| Parameterized verification of ad hoc networks G Delzanno, A Sangnier, G Zavattaro International Conference on Concurrency Theory, 313-327, 2010 | 135 | 2010 |
| On the complexity of parameterized reachability in reconfigurable broadcast networks G Delzanno, A Sangnier, R Traverso, G Zavattaro | 71 | 2012 |
| On the power of cliques in the parameterized verification of ad hoc networks G Delzanno, A Sangnier, G Zavattaro International Conference on Foundations of Software Science and …, 2011 | 66 | 2011 |
| Model checking freeze LTL over one-counter automata S Demri, R Lazić, A Sangnier International Conference on Foundations of Software Science and …, 2008 | 53 | 2008 |
| 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 | 52 | 2012 |
| Solving parity games on integer vectors PA Abdulla, R Mayr, A Sangnier, J Sproston International Conference on Concurrency Theory, 106-120, 2013 | 47 | 2013 |
| 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 | 47 | 2012 |
| On the verification of timed ad hoc networks PA Abdulla, G Delzanno, O Rezine, A Sangnier, R Traverso International Conference on Formal Modeling and Analysis of Timed Systems …, 2011 | 41 | 2011 |
| Playing with probabilities in reconfigurable broadcast networks N Bertrand, P Fournier, A Sangnier International Conference on Foundations of Software Science and Computation …, 2014 | 38 | 2014 |
| Weak time Petri nets strike back! PA Reynier, A Sangnier International Conference on Concurrency Theory, 557-571, 2009 | 38 | 2009 |
| 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 | 37 | 2016 |
| Parameterized verification of broadcast networks of register automata G Delzanno, A Sangnier, R Traverso International Workshop on Reachability Problems, 109-121, 2013 | 36 | 2013 |
| Reversal-bounded counter machines revisited A Finkel, A Sangnier International Symposium on Mathematical Foundations of Computer Science, 323-334, 2008 | 35 | 2008 |
| From pointer systems to counter systems using shape analysis S Bardin, A Finkel, E Lozes, A Sangnier AVIS’06, 2006 | 32 | 2006 |
| When model-checking freeze LTL over counter machines becomes decidable S Demri, A Sangnier International Conference on Foundations of Software Science and …, 2010 | 31 | 2010 |
| 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 | 29 | 2017 |
| Taming past LTL and flat counter systems S Demri, AK Dhar, A Sangnier Information and Computation 242, 306-339, 2015 | 27 | 2015 |
| From time Petri nets to timed automata: An untimed approach D D’Aprile, S Donatelli, A Sangnier, J Sproston International Conference on Tools and Algorithms for the Construction and …, 2007 | 27 | 2007 |
| 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 | 26 | 2010 |
| 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 | 20 | 2010 |
Giorgio DelzannoAssociate Professor, Università di GenovaVerified email at unige.it
