Angelic semantics of fine-grained concurrency

DOI10.1016/J.APAL.2007.10.005zbMath1133.68011OpenAlexW2030121500MaRDI QIDQ2474441

Dan R. Ghica, Andrzej S. Murawski

Publication date: 6 March 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:46b97d31-7737-496a-ba2d-175c34ac5f44

zbMATH Keywords

game semanticsMay-equivalenceshared-memory concurrency

Mathematics Subject Classification ID

Applications of game theory (91A80) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (8)

Geometry of Synthesis II: From Games to Delay-Insensitive Circuits ⋮ Full Abstraction Without Synchronization Primitives ⋮ Game Semantics in the Nominal Model ⋮ A System-Level Game Semantics ⋮ Latent semantic analysis of game models using LSTM ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ Leafy automata for higher-order concurrency ⋮ Unnamed Item

Cites Work

• Bireflectivity
• On full abstraction for PCF: I, II and III
• A Game Semantics of Idealized CSP
• CONCUR 2004 - Concurrency Theory
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Angelic semantics of fine-grained concurrency