Synchronous game semantics via round abstraction

DOI10.1007/978-3-642-19805-2_24MaRDI QIDQ3000620zbMATH OpenOpenAlexFDO

Authors Dan R. Ghica, Mohamed Menaa

Publication date 19 May 2011

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19805-2_24

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the compositionality of round abstraction
• A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables
• Full abstraction without synchronization primitives
• A Game Semantics of Idealized CSP
• Angelic semantics of fine-grained concurrency

Cited in

(6)

• Abstract machines for game semantics, revisited
• Coherent minimisation: towards efficient tamper-proof compilation
• Compositional Predicate Abstraction from Game Semantics
• Non-angelic concurrent game semantics
• On the compositionality of round abstraction
• A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables

This page was built for publication: Synchronous game semantics via round abstraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000620)