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...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 173
Hlavní autori:	Echenim, Mnacho, Iosif, Radu, Peltier, Nicolas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier 01.01.2022
Predmet:	Computer Science Logic in Computer Science Decidability Inductive Definition Separation Logic
ISSN:	0020-0190
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!