Bunched logics have found themselves to be key tools in modern computer science, in
particular through the industrial-level program verification formalism Separation Logic …

Concurrent separation logics have helped to significantly simplify correctness proofs for
concurrent data structures. However, a recurring problem in such proofs is that data structure …

Permission-based verification logics such as separation logic have led to the development
of many practical verification tools over the last decade. Verifiers employ the separating …

Separation logic is used as an assertion language for Hoare-style proof systems about
programs with pointers, and there is an ongoing quest for understanding its complexity and …

Like modal logic, temporal logic, and description logic, separation logic has become a
popular class of logical formalisms in computer science, conceived as assertion languages …

We present a labelled sequent calculus for Boolean bunched implications (BBI), a classical
variant of the logic of Bunched Implications (BI). The calculus is simple, sound, complete and …

This article presents a self-contained proof of the strong completeness of the labelled
tableaux method for partial monoidal Boolean BI: if a formula has no tableau proof then …

This paper considers Reynolds's separation logic with all logical connectives but without
arbitrary predicates. This logic is not recursively enumerable but is very useful in practice …

In recent years, the key principles behind Separation Logic have been generalized to
generate formalisms for a number of verification tasks in program analysis via the …

Separation logic is an expressive logic for reasoning about heap structures in programs.
This paper presents a semi-decision procedure for checking unsatisfiability of formulas in a …