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

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 173
Hlavní autoři: Echenim, Mnacho, Iosif, Radu, Peltier, Nicolas
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier 01.01.2022
Témata:
Computer Science
Logic in Computer Science
Decidability
Inductive Definition
Separation Logic
ISSN:0020-0190
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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