The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations

Marius Bozga
  • Fonction : Auteur
Lucas Bueri
  • Fonction : Auteur
Radu Iosif
  • Fonction : Auteur

Résumé

The treewidth boundedness problem for a logic asks for the existence of an upper bound on the treewidth of the models of a given formula in that logic. This problem is found to be undecidable for first order logic. We consider a generalization of Separation Logic over relational signatures, interpreted over standard relational structures, and describe an algorithm that decides the treewidth boundedness problem for this logic. Furthermore, our algorithm can give an estimate of the bound of the models of a given formula, in case there is a finite such bound.
Fichier principal
Vignette du fichier
paper-lmcs.pdf (1.08 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04264291 , version 1 (30-10-2023)
hal-04264291 , version 2 (23-05-2024)

Licence

Identifiants

Citer

Marius Bozga, Lucas Bueri, Radu Iosif, Florian Zuleger. The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations. 2023. ⟨hal-04264291v2⟩
30 Consultations
13 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More