The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
Logic in Computer Science
2024-05-20 v2 Formal Languages and Automata Theory
Abstract
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 for the treewidth boundedness problem in the context of this logic.
Cite
@article{arxiv.2310.09542,
title = {The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations},
author = {Marius Bozga and Lucas Bueri and Radu Iosif and Florian Zuleger},
journal= {arXiv preprint arXiv:2310.09542},
year = {2024}
}