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

In this paper, we close the logical gap between provability in the logic BBI, which is the
propositional basis for separation logic, and validity in an intended class of separation …

In this article, we perform a detailed proof theoretic investigation of a wide number of
relevant logics by employing the well-established methodology of labelled sequent calculi to …

We propose a rich foundational theory of typed data streams and stream transformers,
motivated by two high-level goals:(1) the type of a stream should be able to express complex …

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 …

In this paper we study proof translations between labelled and label-free calculi for the logic
of Bunched Implications (BI). We first consider the bunched sequent calculus LBI and define …

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 …

In this paper, we show that the formulæ of Boolean BI cannot distinguish between some of
the different notions of separation algebra found in the literature: partial commutative …