70 citations · 123 across the 26 of their papers we have counts for
5 papers · 1 filter
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…
Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
Radu Iosif, Florian Zuleger
We give a characterization of the sets of graphs that are both definable in Counting Monadic Second Order Logic (CMSO) and context-free, i.e., least solutions of Hyperedge-Replacem…
Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems
Benjamin Aminof, Sasha Rubin, Francesco Spegni +1
We study the complexity of the model-checking problem for parameterized discrete-timed systems with arbitrarily many anonymous and identical processes, with and without a distingui…
Expressiveness Results for an Inductive Logic of Separated Relations
Radu Iosif, Florian Zuleger
In this paper we study a Separation Logic of Relations (SLR) and compare its expressiveness to (Monadic)Second Order Logic (M)SO. SLR is based on the well-known Symbolic Heap fragm…
Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration (Extended Version)
Florian Sextl, Adam Rogalewicz, Tomáš Vojnar +1
Biabduction-based shape analysis is a compositional verification and analysis technique that can prove memory safety in the presence of complex, linked data structures. Despite its…