Foundations of Software Science and Computation Structures

DOI10.1007/B95995MaRDI QIDQ5308452zbMATH OpenOpenAlexFDO

Authors Dan R. Ghica, Andrzej S. Murawski

Publication date 28 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b95995

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Angelic semantics of fine-grained concurrency
• A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables
• A Game Semantics of Idealized CSP
• Game Semantics for Higher-Order Concurrency
• The Parallel Intensionally Fully Abstract Games Model of PCF

Cited in

(16)

• Automata, Languages and Programming
• Logic and geometry of agents in agent-based modeling
• Angelic semantics of fine-grained concurrency
• The mays and musts of concurrent strategies
• A graph abstract machine describing event structure composition
• Higher-order linearisability
• Syntactic control of concurrency
• Causality vs. interleavings in concurrent game semantics
• Partial Orders, Event Structures and Linear Strategies
• Asynchronous games. II: The true concurrency of innocence
• Game semantics for access control
• Game Semantics for Higher-Order Concurrency
• Definability and full abstraction
• Grounding game semantics in categorical algebra
• Higher-order linearisability
• Program verification using symbolic game semantics

This page was built for publication: Foundations of Software Science and Computation Structures

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