8 citations · 22 across the 17 of their papers we have counts for
19 papers
Decidability Problems for Micro-Stipula
Giorgio Delzanno, Cosimo Laneve, Arnaud Sangnier +1
Micro-Stipula is a stateful calculus in which clauses can be activated either through interactions with the external environment or by the evaluation of time expressions. Despite t…
Counting Abstraction for the Verification of Structured Parameterized Networks
Marius Bozga, Radu Iosif, Arnaud Sangnier +1
We consider the verification of parameterized networks of replicated processes whose architecture is described by hyperedge-replacement graph grammars. Due to the undecidability of…
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
We consider networks of processes that all execute the same finite-state protocol and communicate via a rendez-vous mechanism. When a process requests a rendez-vous, another proces…
On the Satisfiability of Local First-Order Logics with Data
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the…
On the Existential Fragments of Local First-Order Logics with Data
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfi…
Deciding the existence of cut-off in parameterized rendez-vous networks
Florian Horn, Arnaud Sangnier
We study networks of processes which all execute the same finite-state protocol and communicate thanks to a rendez-vous mechanism. Given a protocol, we are interested in checking w…