A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search

We present a labelled sequent calculus for Boolean BI, a classical variant of O'Hearn and Pym's logic of Bunched Implication. The calculus is simple, sound, complete, and enjoys cut-elimination. We show that all the structural rules in our proof system, including those rules that manipulate labels, can be localised around applications of certain logical rules, thereby localising the handling of these rules in proof search. Based on this, we demonstrate a free variable calculus that deals with the structural rules lazily in a constraint system. A heuristic method to solve the constraints is proposed in the end, with some experimental results.

[1]  Jonghyun Park,et al.  A theorem prover for Boolean BI , 2013, POPL.

[2]  Peter W. O'Hearn,et al.  Local Action and Abstract Separation Logic , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[3]  Sara Negri,et al.  Proof Analysis in Modal Logic , 2005, J. Philos. Log..

[4]  James Brotherston,et al.  Classical BI: Its Semantics and Proof Theory , 2010, Log. Methods Comput. Sci..

[5]  Dominique Larchey-Wendling,et al.  Nondeterministic Phase Semantics and the Undecidability of Boolean BI , 2011, TOCL.

[6]  Andrei Voronkov,et al.  Comparing Unification Algorithms in First-Order Theorem Proving , 2009, KI.

[7]  Bernhard Beckert,et al.  Free-Variable Tableaux for Propositional Modal Logics , 2001, Stud Logica.

[8]  Dominique Larchey-Wendling,et al.  Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding , 2009, Math. Struct. Comput. Sci..

[9]  Peter W. O'Hearn,et al.  The Logic of Bunched Implications , 1999, Bulletin of Symbolic Logic.

[10]  Rajeev Goré,et al.  Proof search for propositional abstract separation logics via labelled sequents , 2014, POPL.

[11]  Dominique Larchey-Wendling,et al.  The Undecidability of Boolean BI through Phase Semantics , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[12]  Rajeev Goré,et al.  A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search , 2013, TABLEAUX.

[13]  Lev Gordeev,et al.  Basic proof theory , 1998 .

[14]  John C. Reynolds,et al.  Separation logic: a logic for shared mutable data structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[15]  Andrew W. Appel,et al.  A Fresh Look at Separation Algebras and Share Accounting , 2009, APLAS.

[16]  Jeremy Dawson,et al.  A Proof Theoretic Analysis of Intruder Theories , 2008, RTA.

[17]  James Brotherston,et al.  Parametric completeness for separation theories , 2014, POPL.

[18]  David J. Pym,et al.  The semantics and proof theory of the logic of bunched implications , 2002, Applied logic series.

[19]  Martín Abadi,et al.  A model of cooperative threads , 2009, POPL '09.

[20]  Dominique Larchey-Wendling.  The formal strong completeness of partial monoidal Boolean BI , 2016, J. Log. Comput..

[21]  Véronique Cortier,et al.  Deciding security properties for cryptographic protocols. application to key cycles , 2007, TOCL.

[22]  James Brotherston,et al.  A Unified Display Proof Theory for Bunched Logic , 2010, MFPS.

[23]  James Brotherston,et al.  Undecidability of Propositional Separation Logic and Its Neighbours , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[24]  Sara Negri,et al.  Structural proof theory , 2001 .

[25]  Dominique Larchey-Wendling,et al.  Expressivity properties of boolean BI through relational models , 2006 .

[26]  W. Marsden.  I and J , 2012 .