Communication Dans Un Congrès Année : 2025

Deciding Satisfiability for Overlaid Symbolic Heaps

Résumé

Separation logic (SL) is a widely used formalism for verifying programs that manipulate dynamically allocated memory, relying on the separating conjunction ⭑ to combine disjoint heap structures. The standard approach in SL lacks the expressive power to handle overlaid data structures where multiple structures share some locations. We consider a logic that extends SL with a new separating conjunction operator ⍟, enabling the composition of heaps with shared locations that allocate distinct fields. Our fragment supports generic inductive definitions and introduces set variables to constrain the locations shared by overlapping structures. We prove that the satisfiability problem for this fragment is in Nexptime, by reducing it to the satisfiability problem in BAPA [13], a decidable logic combining Boolean algebra of sets and Presburger arithmetic.

Fichier principal
Vignette du fichier
FROCOS_2025_paper_10_long_v2.pdf (286.41 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05143101 , version 1 (03-07-2025)
hal-05143101 , version 2 (09-07-2025)
hal-05143101 , version 3 (15-08-2025)

Licence

Identifiants

  • HAL Id : hal-05143101 , version 2

Citer

Nicolas Peltier, Quentin Petitjean, Mihaela Sighireanu. Deciding Satisfiability for Overlaid Symbolic Heaps. FROCOS 2025 - 15th International Symposium on Frontiers of Combining Systems, Sep 2025, Reykjavik, Iceland. ⟨hal-05143101v2⟩
729 Consultations
453 Téléchargements

Partager

  • More