Proof search for propositional abstract separation logics via labelled sequents

Loading...
Thumbnail Image
File version

Accepted Manuscript (AM)

Author(s)
Hou, Zhe
Clouston, Ranald
Goré, Rajeev
Tiu, Alwen
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
2014
Size
File type(s)
Location

San Diego, USA

License
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.

Journal Title
Conference Title

POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming

Book Title
Edition
Volume

49

Issue

1

Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© ACM, 2014. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 978-1-4503-2544-8/, https://doi.org/10.1145/2535838.2535864

Item Access Status
Note
Access the data
Related item(s)
Subject

Theory of computation

Science & Technology

Technology

Computer Science, Software Engineering

Computer Science

Languages

Persistent link to this record
Citation

Hou, Z; Clouston, R; Goré, R; Tiu, A, Proof search for propositional abstract separation logics via labelled sequents, POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming, 2014, 49 (1), pp. 465-467