Follow
Arnaud Sangnier
Arnaud Sangnier
Professore Associato, DIBRIS, Universitŕ di Genova, Italy
Verified email at unige.it - Homepage
Title
Cited by
Cited by
Year
Parameterized verification of ad hoc networks
G Delzanno, A Sangnier, G Zavattaro
CONCUR 2010-Concurrency Theory: 21th International Conference, CONCUR 2010 …, 2010
1142010
On the complexity of parameterized reachability in reconfigurable broadcast networks
G Delzanno, A Sangnier, R Traverso, G Zavattaro
622012
On the power of cliques in the parameterized verification of ad hoc networks
G Delzanno, A Sangnier, G Zavattaro
Foundations of Software Science and Computational Structures: 14th …, 2011
612011
Model checking freeze LTL over one-counter automata
S Demri, R Lazić, A Sangnier
International Conference on Foundations of Software Science and …, 2008
532008
On the decidability status of reachability and coverability in graph transformation systems
N Bertrand, G Delzanno, B König, A Sangnier, J Stückrath
23rd International Conference on Rewriting Techniques and Applications (RTA …, 2012
512012
Solving parity games on integer vectors
PA Abdulla, R Mayr, A Sangnier, J Sproston
CONCUR 2013–Concurrency Theory: 24th International Conference, CONCUR 2013 …, 2013
442013
Verification of ad hoc networks with node and communication failures
G Delzanno, A Sangnier, G Zavattaro
International Conference on Formal Methods for Open Object-Based Distributed …, 2012
432012
On the verification of timed ad hoc networks
PA Abdulla, G Delzanno, O Rezine, A Sangnier, R Traverso
Formal Modeling and Analysis of Timed Systems: 9th International Conference …, 2011
382011
Weak time Petri nets strike back!
PA Reynier, A Sangnier
International Conference on Concurrency Theory, 557-571, 2009
352009
Parameterized verification of broadcast networks of register automata
G Delzanno, A Sangnier, R Traverso
International Workshop on Reachability Problems, 109-121, 2013
342013
Playing with probabilities in reconfigurable broadcast networks
N Bertrand, P Fournier, A Sangnier
Foundations of Software Science and Computation Structures: 17th …, 2014
332014
Reversal-bounded counter machines revisited
A Finkel, A Sangnier
International Symposium on Mathematical Foundations of Computer Science, 323-334, 2008
332008
Reachability in networks of register protocols under stochastic schedulers
P Bouyer, N Markey, M Randour, A Sangnier, D Stan
arXiv preprint arXiv:1602.05928, 2016
322016
From pointer systems to counter systems using shape analysis
S Bardin, A Finkel, E Lozes, A Sangnier
AVIS’06, 2006
322006
Parameterized verification of algorithms for oblivious robots on a ring
A Sangnier, N Sznajder, M Potop-Butucaru, S Tixeuil
2017 Formal Methods in Computer Aided Design (FMCAD), 212-219, 2017
282017
When model-checking freeze LTL over counter machines becomes decidable
S Demri, A Sangnier
International Conference on Foundations of Software Science and …, 2010
282010
Taming past LTL and flat counter systems
S Demri, AK Dhar, A Sangnier
Information and Computation 242, 306-339, 2015
262015
Model checking memoryful linear-time logics over one-counter automata
S Demri, R Lazić, A Sangnier
Theoretical Computer Science 411 (22-24), 2298-2316, 2010
262010
From time Petri nets to timed automata: An untimed approach
D D’Aprile, S Donatelli, A Sangnier, J Sproston
Tools and Algorithms for the Construction and Analysis of Systems: 13th …, 2007
262007
Mixing coverability and reachability to analyze VASS with one zero-test
A Finkel, A Sangnier
International Conference on Current Trends in Theory and Practice of …, 2010
192010
The system can't perform the operation now. Try again later.
Articles 1–20