A semantics for concurrent separation logic

From MaRDI portal
Revision as of 15:48, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:879367

DOI10.1016/J.TCS.2006.12.034zbMath1111.68021OpenAlexW2125398300WikidataQ29396804 ScholiaQ29396804MaRDI QIDQ879367

Stephen Brookes

Publication date: 11 May 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.12.034




Related Items (46)

Automata-theoretic semantics of idealized Algol with passive expressionsAutomated Verification of Parallel Nested DFSA First-Order Logic with FramesCompositional ReasoningAutomated Theorem Proving for Assertions in Separation Logic with All ConnectivesCompleteness for a First-Order Abstract Separation LogicImproving thread-modular abstract interpretationA Formalisation of Smallfoot in HOLA perspective on specifying and verifying concurrent modulesFormal verification of concurrent programs with Read-write locksRevisiting concurrent separation logicBlaming the client: on data refinement in the presence of pointersInter-process buffers in separation logic with rely-guaranteeDesigning a semantic model for a wide-spectrum language with concurrencyParallelized sequential composition and hardware weak memory modelsTrace-based verification of imperative programs with I/OExtracting total Amb programs from proofsA predicate transformer for choreographies. Computing preconditions in choreographic programmingA fine-grained semantics for arrays and pointers under weak memory modelsAn algebraic glimpse at bunched implications and separation logicA calculus and logic of bunched resources and processesA Discrete Geometric Model of Concurrent Program ExecutionIris from the ground up: A modular foundation for higher-order concurrent separation logicUnified Reasoning About Robustness Properties of Symbolic-Heap Separation LogicUnnamed ItemRGITL: a temporal logic framework for compositional reasoning about interleaved programsSeparation Logic Semantics for Communicating ProcessesHigher-Order Separation Logic in Isabelle/HOLCFPartition consistency. A case study in modeling systems with weak memory consistency and proving correctness of their implementationsElucidating concurrent algorithms via layers of abstraction and reificationPrecision and the Conjunction Rule in Concurrent Separation LogicA Resource Analysis of the π-calculusConcurrent Separation Logic and Operational SemanticsFifty years of Hoare's logicAn operational semantics for object-oriented concepts based on the class hierarchyUnnamed ItemComplexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel CompositionGranularity and Concurrent Separation LogicOn Locality and the Exchange Law for Concurrent ProcessesFine-grained concurrency with separation logicVerifying a concurrent garbage collector with a rely-guarantee methodologyReasoning about block-based cloud storage systems via separation logicSeparation Logic TutorialUnnamed ItemStrict Linearizability and Abstract AtomicityOn the relation between concurrent separation logic and concurrent Kleene algebra




Cites Work




This page was built for publication: A semantics for concurrent separation logic