论文信息 - From Stories to Concurrency: How Children Can Play with Formal Methods - 字舞流文

From Stories to Concurrency: How Children Can Play with Formal Methods

[1] Leslie Lamport,et al. Turing lectureThe computer science of concurrency , 2015, Commun. ACM.

[2] Mordechai Ben-Ari,et al. The Temporal Logic of Branching Time , 1981, POPL.

[3] Timothy C. Bell,et al. A low-cost high-impact computer science show for family audiences , 2000, Proceedings 23rd Australasian Computer Science Conference. ACSC 2000 (Cat. No.PR00518).

[4] Alan H. Schoenfeld,et al. Mathematical Problem Solving , 1985 .

[5] Peter Hilton. The Mathematical Component of a Good Education , 1991 .

[6] 守屋悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[7] J. Bruner. Toward a Theory of Instruction , 1966 .

[8] Jiacun Wang,et al. Formal Methods in Computer Science , 2019 .

[9] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[10] Jeff Magee,et al. Concurrency - state models and Java programs , 2006 .