An EXPTIME-complete entailment problem in separation logic ⋆ - Systèmes intelligents pour les données, les connaissances et les humains Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

An EXPTIME-complete entailment problem in separation logic ⋆

An EXPTIME-Complete Entailment Problem in Separation Logic

Résumé

Separation logic (SL) is extensively employed in verification to analyze programs that manipulate dynamically allocated memory. The entailment problem, when dealing with inductively defined predicates or data constraints, is undecidable for SL formulas. Our focus is on addressing a specific fragment of this issue, wherein the consequent is restricted to clauses of some particular form, devoid of inductively defined predicates. We present an algorithm designed to determine the validity of such entailments and demonstrate that the problem is decidable and ExpTime complete under some conditions on the data theory. This algorithm serves the purpose of verifying that the data structures outlined by a given SL formula (the antecedent) adhere to certain shape constraints expressed by the consequent.
Fichier principal
Vignette du fichier
Wollic24-peltier.pdf (236.16 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04618324 , version 1 (20-06-2024)

Identifiants

Citer

Nicolas Peltier. An EXPTIME-complete entailment problem in separation logic ⋆. Wollic 2024 - 30th Workshop on Logic, Language, Information and Computation, 2024, Bern (CH), Switzerland. pp.157-174, ⟨10.1007/978-3-031-62687-6_11⟩. ⟨hal-04618324⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More