Parametric completeness for separation theories
DOI10.1145/2535838.2535844zbMATH Open1284.68112OpenAlexW2101526176MaRDI QIDQ5408441FDOQ5408441
Authors: 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
Recommendations
Formal languages and automata (68Q45) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Cited In (13)
- Separation logics and modalities: a survey
- Stone-type dualities for separation logics
- Bringing Order to the Separation Logic Jungle
- A complete axiomatisation for quantifier-free separation logic
- Abstract hidden Markov models: a monadic account of quantitative information flow
- On temporal and separation logics
- A stone-type duality theorem for separation logic via its underlying bunched logics
- Modular tableaux calculi for separation theories
- Undecidability of propositional separation logic and its neighbours
- An algebraic glimpse at bunched implications and separation logic
- Proof tactics for assertions in separation logic
- Completeness for a first-order abstract separation logic
- An adaptation-complete proof system for local reasoning about cloud storage systems
This page was built for publication: Parametric completeness for separation theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408441)
