Angelic Semantics of Fine-Grained Concurrency

We introduce a game model for a procedural programming language extended with primitives for parallel composition and synchronization on binary semaphores. The model uses an interleaved version of Hyland-Ong-style games, where most of the original combinatorial constraints on positions are replaced with a simple principle naturally related to static process creation. The model is fully abstract for may-equivalence.

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

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

[3]  Davide Sangiorgi,et al.  A pi-calculus Process Semantics of Concurrent Idealised ALGOL , 1999, FoSSaCS.

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

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

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

[7]  Stephen D. Brookes.  Full Abstraction for a Shared-Variable Parallel Language , 1996, Inf. Comput..

[8]  Carl A. Gunter.  Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

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

[10]  Samson Abramsky,et al.  Concurrent games and full completeness , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[11]  Stephen D. Brookes.  The Essence of Parallel Algol , 2002, Inf. Comput..

[12]  Jan Tijmen Udding,et al.  A formal model for defining and classifying delay-insensitive circuits and systems , 1986, Distributed Computing.

[13]  Peter W. O'Hearn,et al.  Algol-like Languages , 1997, Progress in Theoretical Computer Science.

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

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

[16]  Samson Abramsky.  Algorithmic Game Semantics and Component−Based Verification , 2003 .

[17]  Gregory R. Andrews,et al.  Concurrent programming - principles and practice , 1991 .

[18]  Jifeng He,et al.  A Theory of Synchrony and Asynchrony , 1990, Programming Concepts and Methods.

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

[20]  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..

[21]  John C. Reynolds,et al.  The essence of ALGOL , 1997 .