CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113MaRDI QIDQ5311481zbMATH OpenOpenAlexFDO

Authors 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

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) 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)

Recommendations

• A semantics for concurrent separation logic
• Concurrent separation logic and operational semantics
• Revisiting concurrent separation logic
• Separation logic and concurrency
• A separation logic for a promising semantics
• The essence of higher-order concurrent separation logic
• A game semantics of concurrent separation logic
• A separation logic for refining concurrent objects
• Oracle Semantics for Concurrent Separation Logic
• An asynchronous soundness theorem for concurrent separation logic

Cited in

(56)

• Interactive proofs in higher-order concurrent separation logic
• A game semantics of concurrent separation logic
• Fairness, resources, and separation
• Barriers in concurrent separation logic: now with tool support!
• Automatic Parallelization with Separation Logic
• Formal verification of a Java component using the RESOLVE framework
• Oracle Semantics for Concurrent Separation Logic
• An asynchronous soundness theorem for concurrent separation logic
• Precision and the conjunction rule in concurrent separation logic
• \textsc{SecCSL}: security concurrent separation logic
• Concise outlines for a complex logic: a proof outline checker for TaDA
• Separation Logic Contracts for a Java-Like Language with Fork/Join
• scientific article; zbMATH DE number 47204 (Why is no real title available?)
• On grainless footprint semantics for shared-memory programs
• A semantics for concurrent separation logic
• Non-preemptive semantics for data-race-free programs
• Permission accounting in separation logic
• A revisionist history of concurrent separation logic
• Bringing Order to the Separation Logic Jungle
• Retracing CSP
• Convolution as a Unifying Concept
• Syntactic control of interference and concurrent separation logic
• Concurrent separation logic and operational semantics
• Resources, concurrency, and local reasoning
• Resource separation in dynamic logic of propositional assignments
• Concurrent Separation Logic Meets Template Games
• Independence and concurrent separation logic
• A separation logic for a promising semantics
• Concurrent separation logic for pipelined parallelization
• Barriers in Concurrent Separation Logic
• Separation logic and concurrency
• Parameterized Memory Models and Concurrent Separation Logic
• Order out of chaos: proving linearizability using local views
• Abstraction for concurrent objects
• ColoSL: concurrent local subjective logic
• Separation Logic Semantics for Communicating Processes
• Certifying low-level programs with hardware interrupts and preemptive threads
• Impredicative concurrent abstract predicates
• Inter-process buffers in separation logic with rely-guarantee
• Fine-grained concurrency with separation logic
• Permission-based separation logic for message-passing concurrency
• Step-indexed Kripke model of separation logic for storable locks
• Revisiting concurrent separation logic
• Syntactic control of interference for separation logic
• Communicating state transition systems for fine-grained concurrent resources
• Logics and Bisimulation Games for Concurrency, Causality and Conflict
• Resource-tracking concurrent games
• Subjective auxiliary state for coarse-grained concurrency
• A grainless semantics for parallel programs with shared mutable data
• Variables as resource for shared-memory programs: semantics and soundness
• Fault-tolerant resource reasoning
• Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
• Expressing the behavior of three very different concurrent systems by using natural extensions of separation logic
• Local Reasoning for Storable Locks and Threads
• Granularity and concurrent separation logic
• Type soundness and race freedom for Mezzo

This page was built for publication: CONCUR 2004 - Concurrency Theory

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