Arnaud Sangnier

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 38

Top Topics

Qualitative Analysis

Network Protocols

Top Venues

Publications

Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
On the Satisfiability of Local First-Order Logics with Data. Log. Methods Comput. Sci. 20 (3) (2024)
François Laroussinie, Loriane Leclercq, Arnaud Sangnier
QLTL Model-Checking. CSL (2024)
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
Safety Verification of Wait-Only Non-Blocking Broadcast Protocols. CoRR (2024)
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
Phase-Bounded Broadcast Networks over Topologies of Communication. CONCUR (2024)
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
Safety Verification of Wait-Only Non-Blocking Broadcast Protocols. Petri Nets (2024)
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
Phase-Bounded Broadcast Networks over Topologies of Communication. CoRR (2024)
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. CONCUR (2023)
Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. CoRR (2023)
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
On the Satisfiability of Local First-Order Logics with Data. CoRR (2023)
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
On the Existential Fragments of Local First-Order Logics with Data. GandALF (2022)
Sylvain Conchon, Giorgio Delzanno, Arnaud Sangnier
Verification of Contact Tracing Protocols via SMT-based Model Checking and Counting Abstraction. CILC (2021)
Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier
Reachability in Distributed Memory Automata. CSL (2021)
Sylvain Conchon, Giorgio Delzanno, Arnaud Sangnier
On the Parameterized Verification of Abstract Models of Contact Tracing Protocols. OVERLAY@GandALF (2021)
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
Local First-Order Logic with Two Data Values. FSTTCS (2021)
Florian Horn, Arnaud Sangnier
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. CONCUR (2020)
Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil
Parameterized verification of algorithms for oblivious robots on a ring. Formal Methods Syst. Des. 56 (1) (2020)
Florian Horn, Arnaud Sangnier
Deciding the existence of cut-off in parameterized rendez-vous networks. CoRR (2020)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, Marco Montali, Arnaud Sangnier
On the Formalization of Decentralized Contact Tracing Protocols. OVERLAY (2020)
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
The Complexity of Flat Freeze LTL. Log. Methods Comput. Sci. 15 (3) (2019)
Carole Delporte-Gallet, Hugues Fauconnier, Yan Jurski, François Laroussinie, Arnaud Sangnier
Towards Synthesis of Distributed Algorithms with SMT Solvers. NETYS (2019)
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Equivalence between model-checking flat counter systems and Presburger arithmetic. Theor. Comput. Sci. 735 (2018)
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
The Complexity of Flat Freeze LTL. CONCUR (2017)
Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma
Model-checking Counting Temporal Logics on Flat Structures. CoRR (2017)
Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma
Model-Checking Counting Temporal Logics on Flat Structures. CONCUR (2017)
Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil
Parameterized Verification of Algorithms for Oblivious Robots on a Ring. CoRR (2017)
Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil
Parameterized verification of algorithms for oblivious robots on a ring. FMCAD (2017)
Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, Riccardo Traverso
Parameterized verification of time-sensitive models of ad hoc network protocols. Theor. Comput. Sci. 612 (2016)
Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
Qualitative Analysis of VASS-Induced MDPs. FoSSaCS (2016)
Radu Iosif, Arnaud Sangnier
How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property? ATVA (2016)
Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso
Adding Data Registers to Parameterized Networks with Broadcast. Fundam. Informaticae 143 (3-4) (2016)
Benedikt Bollig, Karin Quaas, Arnaud Sangnier
On Parameterized One-Counter Automata. CoRR (2016)
Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan
Reachability in Networks of Register Protocols under Stochastic Schedulers. ICALP (2016)
Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan
Reachability in Networks of Register Protocols under Stochastic Schedulers. CoRR (2016)
Radu Iosif, Arnaud Sangnier
How hard is it to verify flat affine counter systems with the finite monoid property ? CoRR (2016)
François Laroussinie, Nicolas Markey, Arnaud Sangnier
ATLsc with partial observation. GandALF (2015)
Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
Qualitative Analysis of VASS-Induced MDPs. CoRR (2015)
Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier
Distributed Local Strategies in Broadcast Networks. CONCUR (2015)
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Taming past LTL and flat counter systems. Inf. Comput. 242 (2015)
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. RP (2014)
Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier
Playing with Probabilities in Reconfigurable Broadcast Networks. FoSSaCS (2014)
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
On the Complexity of Verifying Regular Properties on Flat Counter Systems CoRR (2013)
Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
Solving Parity Games on Integer Vectors. CONCUR (2013)
Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso
Parameterized Verification of Broadcast Networks of Register Automata. RP (2013)
Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston
Solving Parity Games on Integer Vectors. CoRR (2013)
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
On the Complexity of Verifying Regular Properties on Flat Counter Systems, . ICALP (2) (2013)
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Taming Past LTL and Flat Counter Systems. IJCAR (2012)
Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, Gianluigi Zavattaro
The Cost of Parameterized Reachability in Mobile Ad Hoc Networks CoRR (2012)
Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Taming Past LTL and Flat Counter Systems CoRR (2012)
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro
Verification of Ad Hoc Networks with Node and Communication Failures. FMOODS/FORTE (2012)
Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, Gianluigi Zavattaro
On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. FSTTCS (2012)
Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, Jan Stückrath
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. RTA (2012)
Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier, Riccardo Traverso
On the Verification of Timed Ad Hoc Networks. FORMATS (2011)
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. FoSSaCS (2011)
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro
Parameterized Verification of Safety Properties in Ad Hoc Network Protocols PACO (2011)
Stéphane Demri, Ranko Lazic, Arnaud Sangnier
Model checking memoryful linear-time logics over one-counter automata. Theor. Comput. Sci. 411 (22-24) (2010)
Stéphane Demri, Arnaud Sangnier
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. FoSSaCS (2010)
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro
Parameterized Verification of Ad Hoc Networks. CONCUR (2010)
Sébastien Labbé, Arnaud Sangnier
Formal Verification of Industrial Software with Dynamic Memory Management. PRDC (2010)
Alain Finkel, Arnaud Sangnier
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. SOFSEM (2010)
Pierre-Alain Reynier, Arnaud Sangnier
Weak Time Petri Nets Strike Back!. CONCUR (2009)
Florent Bouchy, Alain Finkel, Arnaud Sangnier
Reachability in Timed Counter Systems. INFINITY (2009)
Alain Finkel, Arnaud Sangnier
Reversal-Bounded Counter Machines Revisited. MFCS (2008)
Stéphane Demri, Ranko Lazic, Arnaud Sangnier
Model checking memoryful linear-time logics over one-counter automata CoRR (2008)
Stéphane Demri, Ranko Lazic, Arnaud Sangnier
Model Checking Freeze LTL over One-Counter Automata. FoSSaCS (2008)
Davide D'Aprile, Susanna Donatelli, Arnaud Sangnier, Jeremy Sproston
From Time Petri Nets to Timed Automata: An Untimed Approach. TACAS (2007)
Alain Finkel, Étienne Lozes, Arnaud Sangnier
Towards Model-Checking Programs with Lists. ILC (2007)