Show simple item record

dc.contributor.authorHou, Zhe
dc.contributor.authorClouston, Ranald
dc.contributor.authorGoré, Rajeev
dc.contributor.authorTiu, Alwen
dc.date.accessioned2020-07-03T06:01:51Z
dc.date.available2020-07-03T06:01:51Z
dc.date.issued2014
dc.identifier.isbn978-1-4503-2544-8
dc.identifier.issn0362-1340
dc.identifier.doi10.1145/2535838.2535864
dc.identifier.urihttp://hdl.handle.net/10072/395148
dc.description.abstractAbstract 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.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherAssociation for Computing Machinery (ACM)
dc.relation.ispartofconferencenamePOPL '14: The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
dc.relation.ispartofconferencetitlePOPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming
dc.relation.ispartofdatefrom2014-01-22
dc.relation.ispartofdateto2014-01-24
dc.relation.ispartoflocationSan Diego, USA
dc.relation.ispartofpagefrom465
dc.relation.ispartofpageto467
dc.relation.ispartofissue1
dc.relation.ispartofvolume49
dc.subject.fieldofresearchTheory of computation
dc.subject.fieldofresearchcode4613
dc.subject.keywordsScience & Technology
dc.subject.keywordsTechnology
dc.subject.keywordsComputer Science, Software Engineering
dc.subject.keywordsComputer Science
dc.subject.keywordsLanguages
dc.titleProof search for propositional abstract separation logics via labelled sequents
dc.typeConference output
dc.type.descriptionE1 - Conferences
dcterms.bibliographicCitationHou, 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
dc.date.updated2020-07-03T05:52:59Z
dc.description.versionAccepted Manuscript (AM)
gro.rights.copyright© 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
gro.hasfulltextFull Text
gro.griffith.authorHou, Zhe


Files in this item

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record