Applications of Game Semantics: From Program Analysis to Hardware Synthesis

After informally reviewing the main concepts from game semantics and placing the development of the field in a historical context we examine its main applications. We focus in particular on finite state model checking, higher order model checking and more recent developments in hardware design.

[1]  Gordon D. Plotkin,et al.  Concrete Domains , 1993, Theor. Comput. Sci..

[2]  James C. Corbett,et al.  Bandera: extracting finite-state models from Java source code , 2000, ICSE.

[3]  C.-H. Luke Ong,et al.  On Model-Checking Trees Generated by Higher-Order Recursion Schemes , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[4]  Samson Abramsky,et al.  Abstract Interpretation, Logical Relations and Kan Extensions , 1990, J. Log. Comput..

[5]  C.-H. Luke Ong,et al.  Pi-calculus, dialogue games and full abstraction PCF , 1995, FPCA '95.

[6]  Stephan Merz,et al.  Model Checking , 2000 .

[7]  Christopher Strachey,et al.  Toward a mathematical semantics for computer languages , 1971 .

[8]  Andrzej S. Murawski,et al.  Nominal games and full abstraction for the nu-calculus , 2004, LICS 2004.

[9]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[10]  Samson Abramsky,et al.  Call-by-Value Games , 1997, CSL.

[11]  Samuel Mimram,et al.  Asynchronous Games: Innocence Without Alternation , 2007, CONCUR.

[12]  Dan R. Ghica,et al.  A games-based foundation for compositional software model checking , 2003 .

[13]  Vincent Danos,et al.  Probabilistic game semantics , 2002, TOCL.

[14]  Andrew M. Pitts,et al.  A First Order Theory of Names and Binding , 2001 .

[15]  C.-H. Luke Ong,et al.  The Safe Lambda Calculus , 2007, TLCA.

[16]  Samson Abramsky,et al.  Games for Recursive Types , 1994, Theory and Formal Methods.

[17]  C.-H. Luke Ong,et al.  Homer: A Higher-Order Observational Equivalence Model checkER , 2009, CAV.

[18]  Didier Caucal.  On Infinite Terms Having a Decidable Monadic Theory , 2002, MFCS.

[19]  James Laird,et al.  A Game Semantics of Idealized CSP , 2001, MFPS.

[20]  C.-H. Luke Ong,et al.  Pi-Calculus, Dialogue Games and PCF. , 1995 .

[21]  Vincent Danos,et al.  Game Semantics & Abstract Machines. , 1996, LICS 1996.

[22]  Pawel Urzyczyn,et al.  Higher-Order Pushdown Trees Are Easy , 2002, FoSSaCS.

[23]  Russell Harmer,et al.  A fully abstract game semantics for finite nondeterminism , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[24]  Samson Abramsky,et al.  A fully abstract game semantics for general references , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[25]  Dan R. Ghica,et al.  The regular-language semantics of second-order idealized ALGOL , 2003, Theor. Comput. Sci..

[26]  Samson Abramsky,et al.  Retracing some paths in Process Algebra , 1996, CONCUR.

[27]  Andrzej S. Murawski,et al.  Angelic Semantics of Fine-Grained Concurrency , 2004, FoSSaCS.

[28]  Peter W. O'Hearn,et al.  Parametricity and local variables , 1995, JACM.

[29]  Dan R. Ghica.  Regular-Language Semantics for a Call-by-Value Programming Language , 2001, MFPS.

[30]  Andrzej S. Murawski,et al.  Angelic semantics of fine-grained concurrency , 2008, Ann. Pure Appl. Log..

[31]  Radha Jagadeesan,et al.  New foundations for the geometry of interaction , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[32]  Pierre-Louis Curien,et al.  Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..

[33]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[34]  Pawel Urzyczyn,et al.  Deciding Monadic Theories of Hyperalgebraic Trees , 2001, TLCA.

[35]  Andrzej S. Murawski,et al.  Idealized Algol with Ground Recursion, and DPDA Equivalence , 2005, ICALP.

[36]  C.-H. Luke Ong.  An approach to deciding the observational equivalence of Algol-like languages , 2004, Ann. Pure Appl. Log..

[37]  Walter Felscher.  Dialogues as a Foundation for Intuitionistic Logic , 2002 .

[38]  John C. Reynolds,et al.  Syntactic Control of Inference, Part 2 , 1989, ICALP.

[39]  Dan R. Ghica,et al.  Compositional Predicate Abstraction from Game Semantics , 2009, TACAS.

[40]  van Ch Kees Berkel.  Handshake circuits : an intermediary between communicating processes and VLSI , 1992 .

[41]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[42]  Andrzej S. Murawski.  About the undecidability of program equivalence in finitary languages with state , 2005, TOCL.

[43]  Klaus Aehlig,et al.  Safety Is not a Restriction at Level 2 for String Languages , 2005, FoSSaCS.

[44]  Dominic J. D. Hughes.  Games and definability for system F , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[45]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[46]  James Laird.  A fully abstract game semantics of local exceptions , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[47]  Andrzej S. Murawski,et al.  Applying Game Semantics to Compositional Software Modeling and Verification , 2004, TACAS.

[48]  Andrzej S. Murawski,et al.  Third-order Idealized Algol with iteration is decidable , 2008, Theor. Comput. Sci..

[49]  Russell Harmer,et al.  Categorical Combinatorics for Innocent Strategies , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[50]  Andrzej S. Murawski,et al.  Compositional Model Extraction for Higher-Order Concurrent Programs , 2006, TACAS.

[51]  Andrzej S. Murawski,et al.  Syntactic control of concurrency , 2006, Theor. Comput. Sci..

[52]  C.-H. Luke Ong.  Observational equivalence of 3rd-order Idealized Algol is decidable , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[53]  Stephen D. Brookes,et al.  Historical Introduction to "Concrete Domains" by G. Kahn and Gordon D. Plotkin , 1993, Theor. Comput. Sci..

[54]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[55]  Chris Hankin,et al.  A New Approach to Control Flow Analysis , 1998, CC.

[56]  Radha Jagadeesan,et al.  Games and full completeness for multiplicative linear logic , 1992, Journal of Symbolic Logic.

[57]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[58]  Paul Blain Levy.  Global State Considered Helpful , 2008, MFPS.

[59]  Dan R. Ghica,et al.  Reasoning about Idealized ALGOL Using Regular Languages , 2000, ICALP.

[60]  Chris Hankin,et al.  Non-deterministic games and program analysis: An application to security , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[61]  Dan R. Ghica,et al.  Geometry of synthesis: a structured approach to VLSI design , 2007, POPL '07.

[62]  Matthew B. Dwyer,et al.  Bandera: extracting finite-state models from Java source code , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[63]  Andrew M. Pitts.  Reasoning about local variables with operationally-based logical relations , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[64]  Vincent Danos,et al.  Game semantics and abstract machines , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[65]  Pierre-Louis Curien.  Symmetry and interactivity in programming , 2003, Bull. Symb. Log..

[66]  Nikos Tzevelekos.  Full abstraction for nominal general references , 2007, LICS.

[67]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[68]  Klaus Aehlig,et al.  The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable , 2005, TLCA.

[69]  Paul-André Melliès.  Asynchronous games 2: The true concurrency of innocence , 2006, Theor. Comput. Sci..

[70]  Dan R. Ghica,et al.  Data-Abstraction Refinement: A Game Semantic Approach , 2005, SAS.

[71]  Ross Street,et al.  Traced monoidal categories , 1996 .

[72]  James Laird,et al.  Full abstraction for functional languages with control , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[73]  Chris Hankin,et al.  Generalised Flowcharts and Games , 1998, ICALP.

[74]  Vincent Danos,et al.  The Anatomy of Innocence , 2001, CSL.

[75]  Dan R. Ghica,et al.  Function interface models for hardware compilation , 2011, Ninth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMPCODE2011).

[76]  Dan R. Ghica,et al.  On-the-Fly Techniques for Game-Based Software Model Checking , 2008, TACAS.

[77]  Thomas A. Henzinger,et al.  Software Verification with BLAST , 2003, SPIN.

[78]  Hanno Nickau.  Hereditarily Sequential Functionals , 1994, LFCS.

[79]  Andrzej S. Murawski,et al.  Games for complexity of second-order call-by-name programs , 2005, Theor. Comput. Sci..

[80]  Dan R. Ghica,et al.  Clipping: A Semantics-Directed Syntactic Approximation , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[81]  Joël Ouaknine,et al.  On Automated Verification of Probabilistic Programs , 2008, TACAS.

[82]  Samson Abramsky,et al.  Linearity, Sharing and State: a fully abstract game semantics for Idealized Algol with active expressions , 1996, Electron. Notes Theor. Comput. Sci..

[83]  James Laird.  A game semantics of names and pointers , 2008, Ann. Pure Appl. Log..

[84]  Dan R. Ghica,et al.  A Counterexample-Guided Refinement Tool for Open Procedural Programs , 2006, SPIN.