9 citations · 36 across the 34 of their papers we have counts for
4 papers · 1 filter
First Order Alternation
Radu Iosif, Xiao Xu
We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with s…
Checking Deadlock-Freedom of Parametric Component-Based Systems
Marius Bozga, Radu Iosif, Joseph Sifakis
We propose an automated method for computing inductive invariants applied to check deadlock-freedom for parametric component-based systems. The method generalizes the approach for…
The Complexity of Prenex Separation Logic with One Selector
Mnacho Echenim, Radu Iosif, Nicolas Peltier
We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with selector fields ($\seplogk{k}$). Second…
On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic
Mnacho Echenim, Radu Iosif, Nicolas Peltier
This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier…