Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 211-225 |
Number of pages | 15 |
Journal | Lecture Notes in Computer Science |
Volume | 2987 |
DOIs | |
Publication status | Published - 1 Mar 2004 |
Event | Foundations of Software Science and Computation Structures, 7th International Conference, (FOSSACS 2004). Part of the Joint European Conferences on Theory and Practice of Software, (ETAPS 2004) - Duration: 1 Mar 2004 → … |