Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules

Entailment is undecidable in general for Separation (SL) Logic formulae with inductive definitions, but it has been shown to be decidable [1] if the inductive rules satisfy three conditions, namely progress, connectivity and establishment. We show that entailment is undecidable if the latter conditi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters Jg. 173
Hauptverfasser:	Echenim, Mnacho, Iosif, Radu, Peltier, Nicolas
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier 01.01.2022
Schlagworte:	Computer Science Logic in Computer Science Decidability Inductive Definition Separation Logic
ISSN:	0020-0190
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Entailment is undecidable in general for Separation (SL) Logic formulae with inductive definitions, but it has been shown to be decidable [1] if the inductive rules satisfy three conditions, namely progress, connectivity and establishment. We show that entailment is undecidable if the latter condition is dropped, thus drawing a much clearer frontier for (un)decidability.
ISSN:	0020-0190
DOI:	10.1016/j.ipl.2021.106169