Testing the Satisfiability of Formulas in Separation Logic with Permissions - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Testing the Satisfiability of Formulas in Separation Logic with Permissions

Résumé

We investigate the satisfiability problem for a fragment of Separation Logic (SL) with inductively defined spatial predicates and permissions. We show that the problem is undecidable in general, but decidable under some restrictions on the rules defining the semantics of the spatial predicates. Furthermore, if the satisfiability of permission formulas can be tested in exponential time for the considered permission model then SL satisfiability is Exptime complete.
Fichier principal
Vignette du fichier
SLp-sat.pdf (561.53 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04163846 , version 1 (17-07-2023)

Identifiants

  • HAL Id : hal-04163846 , version 1

Citer

Nicolas Peltier. Testing the Satisfiability of Formulas in Separation Logic with Permissions. TABLEAUX 2023 32nd International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2023, Prague, Czech Republic. ⟨hal-04163846⟩
10 Consultations
32 Téléchargements

Partager

Gmail Facebook X LinkedIn More