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

Logic in computer science (03B70) 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

• 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

(57)

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

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)