A proof system for separation logic with magic wand
From MaRDI portal
Publication:5408443
DOI10.1145/2535838.2535871zbMath1284.68408OpenAlexW2144482530MaRDI QIDQ5408443
Publication date: 10 April 2014
Published in: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2535838.2535871
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction ⋮ Symbolic execution proofs for higher order store programs ⋮ Automated Theorem Proving for Assertions in Separation Logic with All Connectives ⋮ Completeness for a First-Order Abstract Separation Logic ⋮ Separation logics and modalities: a survey ⋮ An adaptation-complete proof system for local reasoning about cloud storage systems ⋮ Reasoning about block-based cloud storage systems via separation logic
Uses Software
This page was built for publication: A proof system for separation logic with magic wand
