Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2022

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

Résumé

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.
Fichier principal
Vignette du fichier
IPL.pdf (157.07 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03416093 , version 1 (05-11-2021)

Identifiants

Citer

Mnacho Echenim, Radu Iosif, Nicolas Peltier. Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules. Information Processing Letters, 2022, 173, pp.106169. ⟨10.1016/j.ipl.2021.106169⟩. ⟨hal-03416093⟩
28 Consultations
76 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More