Strong-Separation Logic

by   Jens Pagel, et al.

Most automated verifiers for separation logic target the symbolic-heap fragment, disallowing both the magic-wand operator and the application of classical Boolean operators to spatial formulas. This is not surprising, as support for the magic wand quickly leads to undecidability, especially when combined with inductive predicates for reasoning about data structures. To circumvent these undecidability results, we propose to assign a more restrictive semantics to the separating conjunction. We argue that the resulting logic, strong-separation logic, can be used for compositional program verification and bi-abductive static analysis just like "standard" separation logic, while remaining decidable even in the presence of both the magic wand and the list-segment predicate—a combination of features that leads to undecidability assuming the standard semantics.



page 1

page 2

page 3

page 4


A Quantum Interpretation of Bunched Logic for Quantum Separation Logic

We propose a model of the substructural logic of Bunched Implications (B...

Bi-Abduction for Shapes with Ordered Data

Shape analysis is of great importance for the verification of the correc...

A Separation Logic for Negative Dependence

Formal reasoning about hashing-based probabilistic data structures often...

Incremental Vulnerability Detection with Insecurity Separation Logic

We present the first compositional, incremental static analysis for dete...

A Complete Axiomatisation for Quantifier-Free Separation Logic

We present the first complete axiomatisation for quantifier-free separat...

Quantitative Separation Logic

We present quantitative separation logic (QSL). In contrast to classical...

The Effects of Adding Reachability Predicates in Propositional Separation Logic

The list segment predicate ls used in separation logic for verifying pro...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.