The magic wand-∗(also called separating implication) is a separation logic connective
commonly used to specify properties of partial data structures, for instance during iterative …

In spatially located, large scale systems, time and space dynamics interact and drives the
behaviour. Examples of such systems can be found in many smart city applications and …

We develop a doubly exponential decision procedure for the satisfiability problem of
guarded separation logic—a novel fragment of separation logic featuring user-supplied …

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type
theory. Employing synthetic accounts of enumerability and decidability, we give a full …

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 …

The list segment predicate ls ls used in separation logic for verifying programs with pointers
is well-suited to express properties on singly-linked lists. We study the effects of adding ls ls …

We investigate first-order separation logic with one record field restricted to a unique
quantified variable (1SL1). Undecidability is known when the number of quantified variables …

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 …

Separation Logic (SL) is a well-known assertion language used in Hoare-style modular
proof systems for programs with dynamically allocated data structures. In this paper we …

In this paper we study a Separation Logic of Relations (SLR) and compare its
expressiveness to (Monadic) Second Order Logic (M) SO. SLR is based on the well-known …