Abstract
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that mutate memory. These logics are "abstract" because they are independent of any particular concrete memory model. Their assertion languages, called propositional abstract separation logics, extend the logic of (Boolean) Bunched Implications (BBI) in various ways.
We develop a modular proof theory for various propositional abstract separation logics using cut-free labelled sequent calculi. We first extend the cut-fee labelled sequent calculus for BBI of Hou et al to handle Calcagno et al's original logic of separation algebras by adding sound rules for partial-determinism and cancellativity, while preserving cut-elimination. We prove the completeness of our calculus via a sound intermediate calculus that enables us to construct counter-models from the failure to find a proof. We then capture other propositional abstract separation logics by adding sound rules for indivisible unit and disjointness, while maintaining completeness and cut-elimination. We present a theorem prover based on our labelled calculus for these logics.
Supplemental Material
- A. W. Appel. Tactics for separation logic. Unpublished, 2006.Google Scholar
- F. Baader. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003. Google Scholar
Digital Library
- J. Berdine, C. Calcagno, and P. W. O'Hearn. Symbolic execution with separation logic. In phAPLAS, volume 3780 of LNCS, pages 52--68, 2005. Google Scholar
Digital Library
- R. Brochenin, S. Demria, and E. Lozes. On the almighty wand. Inform. and Comput., 211: 106--137, 2012. Google Scholar
Digital Library
- J. Brotherston and M. Kanovich. Undecidability of propositional separation logic and its neighbours. In LICS, pages 130--139. IEEE, 2010. Google Scholar
Digital Library
- J. Brotherston and J. Villard. Parametric completeness for separation theories. Technical Report RN/13/11, UCL, 2013.Google Scholar
- C. Calcagno, H. Yang, and P. W. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In FSTTCS, volume 2245 of phLNCS, pages 108--119, 2001. Google Scholar
Digital Library
- C. Calcagno, P. W. O'Hearn, and H. Yang. Local action and abstract separation logic. In phLICS, pages 366--378. IEEE, 2007. Google Scholar
Digital Library
- C. Calcagno, M. Parkinson, and V. Vafeiadis. Modular safety checking for fine-grained concurrency. In phSAS, volume 4634 of phLNCS, 2007. Google Scholar
Digital Library
- R. Cherini and J. O. Blanco. Local reasoning for abstraction and sharing. In SAC, pages 552--557. ACM, 2009. Google Scholar
Digital Library
- R. Dockins, A. Hobor, and A. W. Appel. A fresh look at separation algebras and share accounting. In phAPLAS, volume 5904 of LNCS, pages 161--177, 2009. Google Scholar
Digital Library
- M. Dodds, S. Jagannathan, and M. J. Parkinson. Modular reasoning for deterministic parallelism. In POPL, pages 259--270. ACM, 2011. Google Scholar
Digital Library
- D. Galmiche and D. Larchey-Wendling. Expressivity properties of boolean BI through relational models. In phFSTTCS, volume 4337 of LNCS, pages 357--368, 2006. Google Scholar
Digital Library
- D. Galmiche and D. Méry. Tableaux and resource graphs for separation logic. J. Logic Comput., 20 (1): 189--231, 2007. Google Scholar
Digital Library
- C. Haack and C. Hurlin. Resource usage protocols for iterators. J. Object Tech., 8 (4): 55--83, 2009.Google Scholar
Cross Ref
- Z. Hóu, A. Tiu, and R. Goré. A labelled sequent calculus for BBI: Proof theory and proof search. In Tableaux, LNCS, 2013. page 172--187; extended version at arXiv:1302.4783.Google Scholar
- S. Ishtiaq and P. W. O'Hearn. BI as an assertion language for mutable data structures. In phPOPL, pages 14--26. ACM, 2001. Google Scholar
Digital Library
- J. B. Jensen and L. Birkedal. Fictional separation logic. In phESOP, volume 7211 of phLNCS, pages 377--396, 2012. Google Scholar
Digital Library
- N. R. Krishnaswami. Reasoning about iterators with separation logic. In SAVCBS, pages 83--86. ACM, 2006. Google Scholar
Digital Library
- D. Larchey-Wendling. The formal strong completeness of partial monoidal boolean BI. To appear in J. Logic. Comput., 2013.Google Scholar
- D. Larchey-Wendling and D. Galmiche. Exploring the relation between intuitionistic BI and boolean BI: An unexpected embedding. Math. Structures Comput. Sci., 19 (3): 435--500, 2009. Google Scholar
Digital Library
- D. Larchey-Wendling and D. Galmiche. The undecidability of boolean BI through phase semantics. In LICS, pages 140--149. IEEE, 2010. Google Scholar
Digital Library
- W. Lee and S. Park. A proof system for separation logic with magic wand. Technical Report CSE-2013--7, POSTECH, 2013.Google Scholar
- A. McCreight. Practical tactics for separation logic. In TPHOLs, volume 5674 of Lecture Notes in Computer Science, pages 343--358. Springer, 2009. Google Scholar
Digital Library
- S. Negri and J. von Plato. Structural Proof Theory. Cambridge University Press, 2001.Google Scholar
Cross Ref
- P. W. O'Hearn and D. J. Pym. The logic of bunched implications. Bull. Symbolic Logic, 5 (2): 215--244, 1999.Google Scholar
Cross Ref
- J. Park, J. Seo, and S. Park. A theorem prover for boolean BI. In POPL, pages 219--232. ACM, 2013. Google Scholar
Digital Library
- M. Parkinson. Local Reasoning for Java. PhD thesis, Cambridge, 2005.Google Scholar
- J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, pages 55--74. IEEE, 2002. Google Scholar
Digital Library
- H. Tuch, G. Klein, and M. Norrish. Types, bytes, and separation logic. In POPL, pages 97--108. ACM, 2007. Google Scholar
Digital Library
- T. Tuerk. A formalisation of smallfoot in HOL. In TPHOLs, volume 5674 of LNCS, 2009. Google Scholar
Digital Library
- V. Vafeiadis and M. Parkinson. A marriage of rely/guarantee and separation logic. In CONCUR, volume 4703 of LNCS, pages 256--271, 2007. Google Scholar
Digital Library
- H. Yang. Local Reasoning for Stateful Programs. PhD thesis, Illinois at Urbana-Champaign, 2001. Google Scholar
Digital Library
Index Terms
Proof search for propositional abstract separation logics via labelled sequents
Recommendations
Proof search for propositional abstract separation logics via labelled sequents
POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming LanguagesAbstract separation logics are a family of extensions of Hoare logic for reasoning about programs that mutate memory. These logics are "abstract" because they are independent of any particular concrete memory model. Their assertion languages, called ...
Modular Labelled Sequent Calculi for Abstract Separation Logics
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that manipulate resources such as memory locations. These logics are “abstract” because they are independent of any particular concrete resource model. ...
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
TABLEAUX '09: Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related MethodsBi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-free labelled sequent calculus for bi-intuitionistic propositional logic, BiInt, ...









Comments