What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment? - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment?

Résumé

The predicate definitions in Separation Logic (SL) play an important role: they capture a large spectrum of unbounded heap shapes due to their inductiveness. This expressiveness power comes with a limitation: the entailment problem is undecidable if predicates have general inductive definitions (ID). Iosif et al. [8] proposed syntactic and semantic conditions, called PCE, on the ID of predicates to ensure the decidability of the entailment problem. We provide a (possibly nonterminating) algorithm to transform arbitrary ID into equivalent PCE definitions when possible. We show that the existence of an equivalent PCE definition for a given ID is undecidable, but we identify necessary conditions that are decidable. The algorithm has been implemented, and experimental results are reported on a benchmark, including significant examples from.
Fichier principal
Vignette du fichier
IJCAR_2024_paper_60_long.pdf (393.96 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04645164 , version 1 (11-07-2024)

Identifiants

Citer

Tanguy Bozec, Nicolas Peltier, Quentin Petitjean, Mihaela Sighireanu. What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment?. IJCAR 2024 - 12th International Joint Conference on Automated Reasoning, Jul 2024, Nancy, France. pp.157-175, ⟨10.1007/978-3-031-63501-4_9⟩. ⟨hal-04645164⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More