| 2025 | CAV | Counting Abstraction and Decidability for the Verification of Structured Parameterized Networks. | Marius Bozga, Radu Iosif, Arnaud Sangnier, Neven Villani |
| 2025 | Coordination | Decidability Problems for Micro-Stipula. | Giorgio Delzanno, Cosimo Laneve, Arnaud Sangnier, Gianluigi Zavattaro |
| 2025 | MFCS | Wait-Only Broadcast Protocols Are Easier to Verify. | Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder |
| 2024 | CONCUR | Phase-Bounded Broadcast Networks over Topologies of Communication. | Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder |
| 2024 | CSL | QLTL Model-Checking. | Franois Laroussinie, Loriane Leclercq, Arnaud Sangnier |
| 2023 | CONCUR | Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. | Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder |
| 2021 | CSL | Reachability in Distributed Memory Automata. | Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier |
| 2020 | CONCUR | Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. | Florian Horn, Arnaud Sangnier |
| 2017 | CONCUR | The Complexity of Flat Freeze LTL. | Benedikt Bollig, Karin Quaas, Arnaud Sangnier |
| 2017 | CONCUR | Model-Checking Counting Temporal Logics on Flat Structures. | Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma |
| 2017 | FMCAD | Parameterized verification of algorithms for oblivious robots on a ring. | Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sbastien Tixeuil |
| 2016 | ATVA | How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property? | Radu Iosif, Arnaud Sangnier |
| 2016 | FOSSACS | Qualitative Analysis of VASS-Induced MDPs. | Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston |
| 2016 | ICALP | Reachability in Networks of Register Protocols under Stochastic Schedulers. | Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan |
| 2015 | CONCUR | Distributed Local Strategies in Broadcast Networks. | Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier |
| 2014 | FOSSACS | Playing with Probabilities in Reconfigurable Broadcast Networks. | Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier |
| 2013 | CONCUR | Solving Parity Games on Integer Vectors. | Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston |
| 2013 | ICALP | On the Complexity of Verifying Regular Properties on Flat Counter Systems, . | Stphane Demri, Amit Kumar Dhar, Arnaud Sangnier |
| 2012 | CADE | Taming Past LTL and Flat Counter Systems. | Stphane Demri, Amit Kumar Dhar, Arnaud Sangnier |
| 2012 | FORTE | Verification of Ad Hoc Networks with Node and Communication Failures. | Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro |
| 2011 | FOSSACS | On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. | Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro |
| 2010 | CONCUR | Parameterized Verification of Ad Hoc Networks. | Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro |
| 2010 | FOSSACS | When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. | Stphane Demri, Arnaud Sangnier |
| 2010 | PRDC | Formal Verification of Industrial Software with Dynamic Memory Management. | Sbastien Labb, Arnaud Sangnier |
| 2010 | SOFSEM | Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. | Alain Finkel, Arnaud Sangnier |
| 2009 | CONCUR | Weak Time Petri Nets Strike Back!. | Pierre-Alain Reynier, Arnaud Sangnier |
| 2008 | FOSSACS | Model Checking Freeze LTL over One-Counter Automata. | Stphane Demri, Ranko Lazic, Arnaud Sangnier |
| 2008 | MFCS | Reversal-Bounded Counter Machines Revisited. | Alain Finkel, Arnaud Sangnier |
| 2007 | TACAS | From Time Petri Nets to Timed Automata: An Untimed Approach. | Davide D'Aprile, Susanna Donatelli, Arnaud Sangnier, Jeremy Sproston |