Communication Dans Un Congrès Année : 2025

The Satisfiability Problem in a Separation Logic of Relations

Résumé

The separation logic of relations (SLR) is a generalization of separation logic (SL) which is useful to describe complex structures like graphs and relational databases. SLR extends SL by interpreting heaps as (multi)sets of relational atoms instead of partial functions. This paper addresses the satisfiability problem for SLR formulas with additional shape constraints (called patterns) expressing conditions such as uniqueness of atoms or functionality of relations. We show that the satisfiability problem is 2-EXPTIME-complete when (dis)equalities over existential variables are excluded from the considered patterns, and undecidable otherwise.

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

Dates et versions

hal-05244161 , version 1 (08-09-2025)

Licence

Identifiants

Citer

Nicolas Peltier. The Satisfiability Problem in a Separation Logic of Relations. Logic, Language, Information, and Computation - 31st International Workshop (Wollic 2025), 2025, Porto, Portugal. pp.260-277, ⟨10.1007/978-3-031-99536-1_16⟩. ⟨hal-05244161⟩
88 Consultations
133 Téléchargements

Altmetric

Partager

  • More