CONCUR 2004 - Concurrency Theory

DOI10.1007/b100113zbMath1099.68650OpenAlexW2499482941MaRDI QIDQ5311481

Stephen Brookes

Publication date: 23 August 2005

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

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

Mathematics Subject Classification ID

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

Related Items

On grainless footprint semantics for shared-memory programs ⋮ A game semantics of concurrent separation logic ⋮ Formal verification of a Java component using the RESOLVE framework ⋮ Certifying low-level programs with hardware interrupts and preemptive threads ⋮ Bringing Order to the Separation Logic Jungle ⋮ A semantics for concurrent separation logic ⋮ Resources, concurrency, and local reasoning ⋮ Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems ⋮ Abstraction for concurrent objects ⋮ Concise outlines for a complex logic: a proof outline checker for TaDA ⋮ Barriers in Concurrent Separation Logic ⋮ Resource separation in dynamic logic of propositional assignments ⋮ A Revisionist History of Concurrent Separation Logic ⋮ Unnamed Item ⋮ Logics and Bisimulation Games for Concurrency, Causality and Conflict ⋮ Retracing CSP