An undecidability result for Separation Logic with theory reasoning - ANR - Agence nationale de la recherche Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2023

An undecidability result for Separation Logic with theory reasoning

Résumé

We show that the entailment problem is undecidable in Separation Logic with inductively defined spatial predicates, for rules satisfying the conditions given in [1], if theory reasoning is considered. The result holds for a wide class of theories, even those with a very low expressive power. For instance it applies to natural numbers with the successor function, or with the usual order relation.
Fichier principal
Vignette du fichier
IPL_22_R2.pdf (198.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04009729 , version 1 (01-03-2023)

Identifiants

Citer

Mnacho Echenim, Nicolas Peltier. An undecidability result for Separation Logic with theory reasoning. Information Processing Letters, 2023, 182, pp.106359. ⟨10.1016/j.ipl.2023.106359⟩. ⟨hal-04009729⟩
13 Consultations
30 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More