Modular Labelled Sequent Calculi for Abstract Separation Logics

10/30/2017
by   Zhé Hóu, et al.
0

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. Their assertion languages, called propositional abstract separation logics (PASLs), extend the logic of (Boolean) Bunched Implications (BBI) in various ways. In particular, these logics contain the connectives * and -, denoting the composition and extension of resources respectively. This added expressive power comes at a price since the resulting logics are all undecidable. Given their wide applicability, even a semi-decision procedure for these logics is desirable. Although several PASLs and their relationships with BBI are discussed in the literature, the proof theory and automated reasoning for these logics were open problems solved by the conference version of this paper, which developed a modular proof theory for various PASLs using cut-free labelled sequent calculi. This paper non-trivially improves upon this previous work by giving a general framework of calculi on which any new axiom in the logic satisfying a certain form corresponds to an inference rule in our framework, and the completeness proof is generalised to consider such axioms. Our base calculus handles Calcagno et al.'s original logic of separation algebras by adding sound rules for partial-determinism and cancellativity, while preserving cut-elimination. We then show that many important properties in separation logic, such as indivisible unit, disjointness, splittability, and cross-split, can be expressed in our general axiom form. Thus our framework offers inference rules and completeness for these properties for free. Finally, we show how our calculi reduce to calculi with global label substitutions, enabling more efficient implementation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/14/2020

Uniform labelled calculi for preferential conditional logics based on neighbourhood semantics

The preferential conditional logic PCL, introduced by Burgess, and its e...
research
02/23/2021

Syntactic completeness of proper display calculi

A recent strand of research in structural proof theory aims at exploring...
research
04/12/2023

Foundations for an Abstract Proof Theory in the Context of Horn Rules

We introduce a novel, logic-independent framework for the study of seque...
research
10/11/2019

Internal Calculi for Separation Logics

We present a general approach to axiomatise separation logics with heapl...
research
11/19/2019

Local Reasoning for Global Graph Properties

Separation logics are widely used for verifying programs that manipulate...
research
09/20/2017

An Algebraic Glimpse at Bunched Implications and Separation Logic

We overview the logic of Bunched Implications (BI) and Separation Logic ...
research
01/06/2021

Logics of First-Order Constraints – A Category Independent Approach

Reflecting our experiences in areas, like Algebraic Specifications, Abst...

Please sign up or login with your details

Forgot password? Click here to reset