Two-Variable Separation Logic and Its Inner Circle

@article{Demri2015TwoVariableSL,
  title={Two-Variable Separation Logic and Its Inner Circle},
  author={Stephane Demri and Morgan Deters},
  journal={ACM Transactions on Computational Logic (TOCL)},
  year={2015},
  volume={16},
  pages={1 - 36}
}
Separation logic is a well-known assertion language for Hoare-style proof systems. We show that first-order separation logic with a unique record field restricted to two quantified variables and no program variables is undecidable. This is among the smallest fragments of separation logic known to be undecidable, and this contrasts with the decidability of two-variable first-order logic. We also investigate its restriction by dropping the magic wand connective, known to be decidable with… 

Figures from this paper

Separation Logic with One Quantified Variable

TLDR
It is shown that the satisfiability problem for 1SL1 is PSPACE-complete and the expressive power of the fragment is characterized by showing that every formula is equivalent to a Boolean combination of atomic properties.

Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction

TLDR
It is shown that first-order separation logic with one record field restricted to two variables and the separating implication (no separating conjunction) is as expressive as weak second-order logic, substantially sharpening a previous result.

Semipositivity in Separation Logic with Two Variables

TLDR
It is proved that satisfiability of the fragment of SPSL2 where neither separating conjunction nor septraction occurs in the scope of universal quantifiers, is complete, and it is shown that the finite satisfiability problem of first-order logic with two variables and a bounded number of function symbols is \(\textsc {nexptime}\)-complete.

On the Complexity of Modal Separation Logics

We introduce a modal separation logic MSL whose models are memory states from separation logic and the logical connectives include modal operators as well as separating conjunction and implication

Extending Propositional Separation Logic for Robustness Properties

We study an extension of propositional separation logic that can specify robustness properties, such as acyclicity and garbage freedom, for automatic verification of stateful programs with

The power of modal separation logics

TLDR
It is established that the full logic MSL admits an undecidable satisfiability problem and variants of MSL with alternative semantics are investigated and bridges with interval temporal logics and with logics equipped with sabotage operators are built.

An Auxiliary Logic on Trees: on the Tower-Hardness of Logics Featuring Reachability and Submodel Reasoning

TLDR
A set of simple features are described that are sufficient in order to make the satisfiability problem of logics interpreted on trees Tower-hard and it is proved that this logic is captured by four other logics that were independently found to be Tower-complete.

Decidability of weak logics with deterministic transitive closure

TLDR
This paper considers the extension of the two-variable fragment of first-order logic by the deterministic transitive closure of a single binary relation, and proves that the satisfiability and finite satisfiability problems for the obtained logic are decidable and ExpSpace-complete.

Automated reasoning and randomization in separation logic

TLDR
A weakest precondition calculus à la Dijkstra is developed, which is a sound and conservative extension of both separation logic and McIver and Morgan’s weakest preexpectations which preserves virtually all properties of classical separation logic.

Separation logics and modalities: a survey

TLDR
This survey presents similarities between separation logic as an assertion language and modal and temporal logics and proposes a selection of landmark results about decidability, complexity and expressive power.

References

SHOWING 1-10 OF 68 REFERENCES

Separation Logic with One Quantified Variable

TLDR
It is shown that the satisfiability problem for 1SL1 is PSPACE-complete and the expressive power of the fragment is characterized by showing that every formula is equivalent to a Boolean combination of atomic properties.

Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction

TLDR
It is shown that first-order separation logic with one record field restricted to two variables and the separating implication (no separating conjunction) is as expressive as weak second-order logic, substantially sharpening a previous result.

Undecidability of Propositional Separation Logic and Its Neighbours

TLDR
It is shown that the purely propositional fragment of separation logic is undecidability, and a number of propositional systems which approximate separation logic are undecidable as well, including both Boolean BI and Classical BI.

The Tree Width of Separation Logic with Recursive Definitions

TLDR
It is proved that any Separation Logic formula using rather general recursively defined predicates is decidable for satisfiability, and moreover, entailments between such formulae are decidability for validity.

On the almighty wand

Undecidability results on two-variable logics

TLDR
It is shown that going beyond L2 by adding any one of the following leads to an undecidable logic: very weak forms of recursion, such as transitive closure or monadic fixed-point operations.

Two-Variable Logic with Two Order Relations

It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further

Decidability of weak logics with deterministic transitive closure

TLDR
This paper considers the extension of the two-variable fragment of first-order logic by the deterministic transitive closure of a single binary relation, and proves that the satisfiability and finite satisfiability problems for the obtained logic are decidable and ExpSpace-complete.

Two variable first-order logic over ordered domains

  • M. Otto
  • Mathematics, Computer Science
    Journal of Symbolic Logic
  • 2001
Abstract The satisfiability problem for the two-variable fragment of first-order logic is investigated over finite and infinite linearly ordered, respectively wellordered domains, as well as over

Tractable Reasoning in a Fragment of Separation Logic

TLDR
The problem of entailment in separation logic formulae is shown to be solved in polynomial time and it is shown that every satisfiable formula is equivalent to one whose graph is in a particular normal form.
...