CSL 2020
Internal Calculi for Separation Logics
Abstract
We present a general approach to axiomatise separation logics with heaplet semantics with no external features such as nominals/labels. To start with, we design the first (internal) Hilbert-style axiomatisation for the quantifier-free separation logic SL(∗, -*). We instantiate the method by introducing a new separation logic with essential features: it is equipped with the separating conjunction, the predicate ls, and a natural guarded form of first-order quantification. We apply our approach for its axiomatisation. As a by-product of our method, we also establish the exact expressive power of this new logic and we show PSpace-completeness of its satisfiability problem.
Authors
Keywords
Context
- Venue
- Annual Conference on Computer Science Logic
- Archive span
- 1988-2026
- Indexed papers
- 1413
- Paper id
- 753457280329034562