Towards Model-Checking Programs with Lists. - Alain Finkel; Étienne Lozes; Arnaud Sangnier (ILC, 2007)

From Time Petri Nets to Timed Automata: An Untimed Approach. - Davide D'Aprile; Susanna Donatelli; Arnaud Sangnier; Jeremy Sproston (TACAS, 2007)

Model Checking Freeze LTL over One-Counter Automata. - Stéphane Demri; Ranko Lazic 001; Arnaud Sangnier (FoSSaCS, 2008)

Reversal-Bounded Counter Machines Revisited. - Alain Finkel; Arnaud Sangnier (MFCS, 2008)

Weak Time Petri Nets Strike Back!. - Pierre-Alain Reynier; Arnaud Sangnier (CONCUR, 2009)

Reachability in Timed Counter Systems. - Florent Bouchy; Alain Finkel; Arnaud Sangnier (INFINITY, 2009)

Parameterized Verification of Ad Hoc Networks. - Giorgio Delzanno; Arnaud Sangnier; Gianluigi Zavattaro (CONCUR, 2010)

When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. - Stéphane Demri; Arnaud Sangnier (FoSSaCS, 2010)

Formal Verification of Industrial Software with Dynamic Memory Management. - Sébastien Labbé 002; Arnaud Sangnier (PRDC, 2010)

Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. - Alain Finkel; Arnaud Sangnier (SOFSEM, 2010)

Model checking memoryful linear-time logics over one-counter automata. - Stéphane Demri; Ranko Lazic 001; Arnaud Sangnier (Theor. Comput. Sci., 2010)

On the Verification of Timed Ad Hoc Networks. - Parosh Aziz Abdulla; Giorgio Delzanno; Othmane Rezine; Arnaud Sangnier; Riccardo Traverso (FORMATS, 2011)

On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. - Giorgio Delzanno; Arnaud Sangnier; Gianluigi Zavattaro (FoSSaCS, 2011)

Parameterized Verification of Safety Properties in Ad Hoc Network Protocols - Giorgio Delzanno; Arnaud Sangnier; Gianluigi Zavattaro (PACO, 2011)

Verification of Ad Hoc Networks with Node and Communication Failures. - Giorgio Delzanno; Arnaud Sangnier; Gianluigi Zavattaro (FMOODS/FORTE, 2012)

On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. - Giorgio Delzanno; Arnaud Sangnier; Riccardo Traverso; Gianluigi Zavattaro (FSTTCS, 2012)

On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. - Nathalie Bertrand 001; Giorgio Delzanno; Barbara König 001; Arnaud Sangnier; Jan Stückrath (RTA, 2012)

The Cost of Parameterized Reachability in Mobile Ad Hoc Networks - Giorgio Delzanno; Arnaud Sangnier; Riccardo Traverso; Gianluigi Zavattaro (CoRR, 2012)

Solving Parity Games on Integer Vectors. - Parosh Aziz Abdulla; Richard Mayr; Arnaud Sangnier; Jeremy Sproston (CONCUR, 2013)

On the Complexity of Verifying Regular Properties on Flat Counter Systems, . - Stéphane Demri; Amit Kumar Dhar; Arnaud Sangnier (ICALP (2), 2013)

Parameterized Verification of Broadcast Networks of Register Automata. - Giorgio Delzanno; Arnaud Sangnier; Riccardo Traverso (RP, 2013)

Playing with Probabilities in Reconfigurable Broadcast Networks. - Nathalie Bertrand 001; Paulin Fournier; Arnaud Sangnier (FoSSaCS, 2014)

Distributed Local Strategies in Broadcast Networks. - Nathalie Bertrand 001; Paulin Fournier; Arnaud Sangnier (CONCUR, 2015)

ATLsc with partial observation. - François Laroussinie; Nicolas Markey; Arnaud Sangnier (GandALF, 2015)

Taming past LTL and flat counter systems. - Stéphane Demri; Amit Kumar Dhar; Arnaud Sangnier (Inf. Comput., 2015)

How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property? - Radu Iosif; Arnaud Sangnier (ATVA, 2016)

Qualitative Analysis of VASS-Induced MDPs. - Parosh Aziz Abdulla; Radu Ciobanu; Richard Mayr; Arnaud Sangnier; Jeremy Sproston (FoSSaCS, 2016)

Reachability in Networks of Register Protocols under Stochastic Schedulers. - Patricia Bouyer; Nicolas Markey; Mickael Randour; Arnaud Sangnier; Daniel Stan (ICALP, 2016)

On Parameterized One-Counter Automata. - Benedikt Bollig; Karin Quaas; Arnaud Sangnier (CoRR, 2016)

Adding Data Registers to Parameterized Networks with Broadcast. - Giorgio Delzanno; Arnaud Sangnier; Riccardo Traverso (Fundam. Informaticae, 2016)

Parameterized verification of time-sensitive models of ad hoc network protocols. - Parosh Aziz Abdulla; Giorgio Delzanno; Othmane Rezine; Arnaud Sangnier; Riccardo Traverso (Theor. Comput. Sci., 2016)

Model-Checking Counting Temporal Logics on Flat Structures. - Normann Decker; Peter Habermehl; Martin Leucker; Arnaud Sangnier; Daniel Thoma (CONCUR, 2017)

Equivalence between model-checking flat counter systems and Presburger arithmetic. - Stéphane Demri; Amit Kumar Dhar; Arnaud Sangnier (Theor. Comput. Sci., 2018)

Towards Synthesis of Distributed Algorithms with SMT Solvers. - Carole Delporte-Gallet; Hugues Fauconnier; Yan Jurski; François Laroussinie; Arnaud Sangnier (NETYS, 2019)

The Complexity of Flat Freeze LTL. - Benedikt Bollig; Karin Quaas; Arnaud Sangnier (Log. Methods Comput. Sci., 2019)

Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. - Florian Horn 001; Arnaud Sangnier (CONCUR, 2020)

On the Formalization of Decentralized Contact Tracing Protocols. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Giorgio Delzanno; Marco Montali; Arnaud Sangnier (OVERLAY, 2020)

Parameterized verification of algorithms for oblivious robots on a ring. - Arnaud Sangnier; Nathalie Sznajder; Maria Potop-Butucaru; Sébastien Tixeuil (Formal Methods Syst. Des., 2020)

Verification of Contact Tracing Protocols via SMT-based Model Checking and Counting Abstraction. - Sylvain Conchon; Giorgio Delzanno; Arnaud Sangnier (CILC, 2021)

Reachability in Distributed Memory Automata. - Benedikt Bollig; Fedor Ryabinin; Arnaud Sangnier (CSL, 2021)

Local First-Order Logic with Two Data Values. - Benedikt Bollig; Arnaud Sangnier; Olivier Stietel (FSTTCS, 2021)

On the Parameterized Verification of Abstract Models of Contact Tracing Protocols. - Sylvain Conchon; Giorgio Delzanno; Arnaud Sangnier (OVERLAY@GandALF, 2021)

On the Existential Fragments of Local First-Order Logics with Data. - Benedikt Bollig; Arnaud Sangnier; Olivier Stietel (GandALF, 2022)

Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. - Lucie Guillou; Arnaud Sangnier; Nathalie Sznajder (CONCUR, 2023)

Safety Verification of Wait-Only Non-Blocking Broadcast Protocols. - Lucie Guillou; Arnaud Sangnier; Nathalie Sznajder (Petri Nets, 2024)

Phase-Bounded Broadcast Networks over Topologies of Communication. - Lucie Guillou; Arnaud Sangnier; Nathalie Sznajder (CONCUR, 2024)

QLTL Model-Checking. - François Laroussinie; Loriane Leclercq; Arnaud Sangnier (CSL, 2024)

On the Satisfiability of Local First-Order Logics with Data. - Benedikt Bollig; Arnaud Sangnier; Olivier Stietel (Log. Methods Comput. Sci., 2024)

Counting Abstraction and Decidability for the Verification of Structured Parameterized Networks. - Marius Bozga; Radu Iosif; Arnaud Sangnier; Neven Villani (CAV (3), 2025)

Decidability Problems for Micro-Stipula. - Giorgio Delzanno; Cosimo Laneve; Arnaud Sangnier; Gianluigi Zavattaro (COORDINATION, 2025)

Wait-Only Broadcast Protocols Are Easier to Verify. - Lucie Guillou; Arnaud Sangnier; Nathalie Sznajder (MFCS, 2025)

Counting Abstraction for the Verification of Structured Parameterized Networks. - Marius Bozga; Radu Iosif; Arnaud Sangnier; Neven Villani (CoRR, 2025)

Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars. - Radu Iosif; Arnaud Sangnier; Neven Villani (CoRR, 2025)