An algebraic glimpse at bunched implications and separation logic
From MaRDI portal
Publication:6201543
DOI10.1007/978-3-030-76920-8_5arXiv1709.07063OpenAlexW2759139027MaRDI QIDQ6201543FDOQ6201543
Authors: Peter Jipsen, Tadeusz Litak
Publication date: 25 March 2024
Published in: Outstanding Contributions to Logic (Search for Journal in Brave)
Abstract: We overview the logic of Bunched Implications (BI) and Separation Logic (SL) from a perspective inspired by Hiroakira Ono's algebraic approach to substructural logics. We propose generalized BI algebras (GBI-algebras) as a common framework for algebras arising via "declarative resource reading", intuitionistic generalizations of relation algebras and arrow logics and the distributive Lambek calculus with intuitionistic implication. Apart from existing models of BI (in particular, heap models and effect algebras), we also cover models arising from weakening relations, formal languages or more fine-grained treatment of labelled trees and semistructured data. After briefly discussing the lattice of subvarieties of GBI, we present a suitable duality for GBI along the lines of Esakia and Priestley and an algebraic proof of cut elimination in the setting of residuated frames of Galatos and Jipsen. We also show how the algebraic approach allows generic results on decidability, both positive and negative ones. In the final part of the paper, we gently introduce the substructural audience to some theory behind state-of-art tools, culminating with an algebraic and proof-theoretic presentation of (bi-)abduction.
Full work available at URL: https://arxiv.org/abs/1709.07063
Cites Work
- A substructural logic for layered graphs
- Stone-type dualities for separation logics
- Bunched hypersequent calculi for distributive substructural logics
- Separation logic with one quantified variable
- Two-Variable Separation Logic and Its Inner Circle
- Featherweight VeriFast
- Dafny: an automatic program verifier for functional correctness
- Title not available (Why is that?)
- ModuRes: a Coq library for modular reasoning about concurrent higher-order imperative programming languages
- Title not available (Why is that?)
- Cylindric algebras. Part II
- Possible worlds and resources: The semantics of \(\mathbf{BI}\)
- Display logic
- The semantics and proof theory of the logic of bunched implications
- The semantics of BI and resource tableaux
- The undecidability of entailment and relevant implication
- Title not available (Why is that?)
- The Logic of Bunched Implications
- Title not available (Why is that?)
- BI as an assertion language for mutable data structures
- Effect algebras and unsharp quantum logics.
- Title not available (Why is that?)
- A semantics for concurrent separation logic
- Residuated frames with applications to decidability
- An axiomatic basis for computer programming
- Relation algebras
- Residuated lattices. An algebraic glimpse at substructural logics
- An algebraic approach to non-classical logics
- Adding involution to residuated structures
- The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
- On closed elements in closure algebras
- Variables as resource in separation logic
- Title not available (Why is that?)
- Algebraizable logics
- Soundness and Completeness of an Axiom System for Program Verification
- Context logic and tree update
- Programming Languages and Systems
- On closed categories of functors
- Title not available (Why is that?)
- Resources, concurrency, and local reasoning
- Implicational (semilinear) logics. I: A new hierarchy
- Programming Languages and Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Completeness results for linear logic on Petri nets
- Title not available (Why is that?)
- Separation logics and modalities: a survey
- Title not available (Why is that?)
- Concurrent Kleene algebra with tests and branching automata
- Scalable Shape Analysis for Systems Code
- Title not available (Why is that?)
- Concurrent Kleene algebra with tests
- Algebraic separation logic
- Concurrent Kleene algebra and its foundations
- On Hoare logic and Kleene algebra with tests
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributive full Lambek calculus has the finite model property
- Cut-elimination theorem for relevant logics
- Title not available (Why is that?)
- Cut elimination and strong separation for substructural logics: an algebraic approach
- Title not available (Why is that?)
- Semantics for relevant logics
- Algebraic aspects of cut elimination
- Minimal varieties of residuated lattices
- Nondeterministic phase semantics and the undecidability of Boolean BI
- Undecidability of propositional separation logic and its neighbours
- Context logic as modal logic, completeness and parametric inexpressivity
- Title not available (Why is that?)
- Anytime, anywhere: modal logics for mobile ambients
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Separation logic and abstraction
- Title not available (Why is that?)
- Hoare logic and auxiliary variables
- Title not available (Why is that?)
- A coalgebraic view of Heyting duality
- Free Modular Lattices
- Duality for algebras of relevant logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- The structure of generalized BI-algebras and weakening relation algebras
- Higher-order ghost state
- Title not available (Why is that?)
- Some modal aspects of XPath
- Relation algebras as residuated Boolean algebras
- Distributive residuated frames and generalized bunched implication algebras
- Special issue: abductive logic programming
- Compositional shape analysis by means of bi-abduction
- Adjuncts elimination in the static ambient logic
- TQL: a query language for semistructured data based on the ambient logic
- Complete axiomatizations for XPath fragments
- Adjunct elimination in context logic for trees
- Decidable and undecidable logics with a binary modality
- The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
- Title not available (Why is that?)
- Nonrepresentable sequential algebras
- Classical BI: Its Semantics and Proof Theory
- Expressivity Properties of Boolean BI Through Relational Models
- Parametric completeness for separation theories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decision problems for distributive lattice-ordered semigroups
- Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding
- On the relation between concurrent separation logic and concurrent Kleene algebra
- Title not available (Why is that?)
This page was built for publication: An algebraic glimpse at bunched implications and separation logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6201543)