4 papers · 1 filter
Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
Lucas Bueri, Radu Iosif, Florian Zuleger
A class of graph languages is definable in Monadic Second-Order logic (MSO) if and only if it consists of sets of models of MSO formulæ. If, moreover, there is a computable bound o…
The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
Marius Bozga, Lucas Bueri, Radu Iosif +1
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…
On an Invariance Problem for Parameterized Concurrent Systems
Marius Bozga, Lucas Bueri, Radu Iosif
We consider concurrent systems consisting of replicated finite-state processes that synchronize via joint interactions in a network with user-defined topology. The system is specif…
Decision Problems in a Logic for Reasoning about Reconfigurable Distributed Systems
Marius Bozga, Lucas Bueri, Radu Iosif
We consider a logic used to describe sets of configurations of distributed systems, whose network topologies can be changed at runtime, by reconfiguration programs. The logic uses…