The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
Marius Dorel Bozga, Lucas Bueri, Radu Iosif, Florian Zuleger · arXiv (Cornell University) · 2023
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.