1 citations · 1 across the 6 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2024
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…
cs.LO2022★ 1 cited
On the Expressiveness of a Logic of Separated Relations
Radu Iosif, Florian Zuleger
We compare the model-theoretic expressiveness of the existential fragment of Separation Logic over unrestricted relational signatures (SLR) -- with only separating conjunction as l…
cs.LO2016
Reasoning in the Bernays-Schoenfinkel-Ramsey Fragment of Separation Logic
Andrew Reynolds, Radu Iosif, Cristina Serban
Separation Logic (SL) is a well-known assertion language used in Hoare-style modular proof systems for programs with dynamically allocated data structures. In this paper we investi…