Transitive Separation Logic

DOI10.1007/978-3-642-33314-9_1zbMath1330.03070OpenAlexW84100119MaRDI QIDQ2915132

Han-Hing Dang, Bernhard Möller

Publication date: 21 September 2012

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/files/58757/58757.pdf

zbMATH Keywords

reachabilityseparation logicsharingstrong separation

Mathematics Subject Classification ID

Logic in computer science (03B70) Other algebras related to logic (03G25) Data structures (68P05)

Related Items (3)

Developments in concurrent Kleene algebra ⋮ A Program Construction and Verification Tool for Separation Logic ⋮ Extended transitive separation logic

Uses Software

• TPTP
• Prover9
• Mace4

Cites Work

• Unnamed Item
• Algebraic separation logic
• The inverse semigroup of a sum-ordered semiring
• Extending separation logic with fixpoints and postponed substitution
• Resources, concurrency, and local reasoning
• The TPTP problem library. CNF release v1. 2. 1
• A completeness theorem for Kleene algebras and the algebra of regular events
• Characterizing determinacy in Kleene algebras
• Calculating with acyclic and cyclic lists
• Proof of correctness of data representations
• On Locality and the Exchange Law for Concurrent Processes
• Abstraction of Object Graphs in Program Verification
• Kleene algebra with domain
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Relational and Kleene-Algebraic Methods in Computer Science

This page was built for publication: Transitive Separation Logic