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.
Work funded by British EPSRC, Canadian NSERC and St John’s College, Oxford.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Brookes, S.: The essence of Parallel Algol. In:[2], Ch.21
O’Hearn, P.W., Tennent, R.D. (eds.): Algol-like Languages. Progress in Theoretical Computer Science, Birkhäuser (1997)
Abramsky, S., McCusker, G.: Linearity, sharing and state: A fully abstract game semantics for Idealized Algol with active expressions. In: [2],Ch.20
Hyland, J.M.E., Ong, C.-H.L.: On full abstraction for PCF: I, II and III. Information and Computation 163(2), 285–408 (2000)
Abramsky, S., Melliès, P.A.: Concurrent games and full completeness. In: Proceedings of LICS, pp. 431–442 (1999)
Abramsky, S.: Game semantics of Idealized Parallel Algol. Lecture given at the Newton Institute (1995)
Laird, J.: A games semantics of Idealized CSP,vol. 45th Electronic Notes in Theoretical Computer Science, pp. 157–176 (2001)
Brookes, S.: Full abstraction for a shared variable parallel language. In: [2], Ch.21
Röckl, C., Sangiorgi, D.: A π-calculus process semantics of Concurrent Idealized Algol. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 306–322. Springer, Heidelberg (1999)
Udding, J.T.: A formal model for defining and classifying delay-insensitive circuits and systems. Distributed Computing 1(4), 197–204 (1986)
Jifeng, H., Josephs, M.B., Hoare, C.A.R.: A theory of synchrony and asynchrony. In: Programming Concepts and Methods, pp. 459–473. Elsevier, Amsterdam (1990)
Andrews, G.: Concurrent Programming: principles and practice. Addison-Wesley Publishing Company, Reading (1991)
Ghica, D.R., Murawski, A.S.: Angelic semantics of fine-grained concurrency. Technical Report PRG-RR-03-20. Oxford University Computing Laboratory (2003)
Ghica, D.R., McCusker, G.: Reasoning about idealized ALGOL using regular languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 103–116. Springer, Heidelberg (2000)
Abramsky, S., Ghica, D.R., Murawski, A.S., Ong, C.-H.L.: Algorithmic game semantics and component-based verification. In: Proceedings of TACAS. LNCS (2004)
Harmer, R., McCusker, G.: A fully abstract game semantics for finite nondeterminism. In: Proceedings of LICS, pp. 422–430 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghica, D.R., Murawski, A.S. (2004). Angelic Semantics of Fine-Grained Concurrency. In: Walukiewicz, I. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2004. Lecture Notes in Computer Science, vol 2987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24727-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-24727-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21298-0
Online ISBN: 978-3-540-24727-2
eBook Packages: Springer Book Archive