Parametric completeness for separation theories
From MaRDI portal
Publication:5408441
DOI10.1145/2535838.2535844zbMath1284.68112OpenAlexW2101526176MaRDI QIDQ5408441
James Brotherston, Jules Villard
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.2535844
Formal languages and automata (68Q45) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
A stone-type duality theorem for separation logic via its underlying bunched logics ⋮ Bringing Order to the Separation Logic Jungle ⋮ Completeness for a First-Order Abstract Separation Logic ⋮ Undecidability of Propositional Separation Logic and Its Neighbours ⋮ Separation logics and modalities: a survey ⋮ Proof tactics for assertions in separation logic ⋮ An algebraic glimpse at bunched implications and separation logic ⋮ Unnamed Item ⋮ On Temporal and Separation Logics ⋮ Unnamed Item ⋮ An adaptation-complete proof system for local reasoning about cloud storage systems ⋮ Unnamed Item
