default search action
Arnaud Sangnier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
On the Satisfiability of Local First-Order Logics with Data. Log. Methods Comput. Sci. 20(3) (2024) - [c42]Lucie Guillou
, Arnaud Sangnier
Safety Verification of Wait-Only Non-Blocking Broadcast Protocols. Petri Nets 2024: 291-311 - [c41]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Phase-Bounded Broadcast Networks over Topologies of Communication. CONCUR 2024: 26:1-26:16 - [c40]François Laroussinie, Loriane Leclercq
QLTL Model-Checking. CSL 2024: 35:1-35:18 - [i16]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Safety Verification of Wait-Only Non-Blocking Broadcast Protocols. CoRR abs/2403.18591 (2024) - [i15]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Phase-Bounded Broadcast Networks over Topologies of Communication. CoRR abs/2406.15202 (2024) - 2023
- [c39]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. CONCUR 2023: 7:1-7:17 - [i14]Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
On the Satisfiability of Local First-Order Logics with Data. CoRR abs/2307.00831 (2023) - [i13]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. CoRR abs/2307.04546 (2023) - 2022
- [c38]Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
On the Existential Fragments of Local First-Order Logics with Data. GandALF 2022: 1-16 - 2021
- [c37]Sylvain Conchon, Giorgio Delzanno, Arnaud Sangnier:
Verification of Contact Tracing Protocols via SMT-based Model Checking and Counting Abstraction. CILC 2021: 77-91 - [c36]Benedikt Bollig, Fedor Ryabinin, Arnaud Sangnier:
Reachability in Distributed Memory Automata. CSL 2021: 13:1-13:16 - [c35]Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
Local First-Order Logic with Two Data Values. FSTTCS 2021: 39:1-39:15 - [c34]Sylvain Conchon, Giorgio Delzanno, Arnaud Sangnier:
On the Parameterized Verification of Abstract Models of Contact Tracing Protocols. OVERLAY@GandALF 2021: 61-66 - 2020
- [j7]Arnaud Sangnier
Parameterized verification of algorithms for oblivious robots on a ring. Formal Methods Syst. Des. 56(1): 55-89 (2020) - [c33]Florian Horn, Arnaud Sangnier
Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. CONCUR 2020: 46:1-46:16 - [c32]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Giorgio Delzanno, Marco Montali, Arnaud Sangnier:
On the Formalization of Decentralized Contact Tracing Protocols. OVERLAY 2020: 65-70 - [i12]Florian Horn, Arnaud Sangnier:
Deciding the existence of cut-off in parameterized rendez-vous networks. CoRR abs/2007.05789 (2020)
2010 – 2019
- 2019
- [j6]Benedikt Bollig, Karin Quaas, Arnaud Sangnier
The Complexity of Flat Freeze LTL. Log. Methods Comput. Sci. 15(3) (2019) - [c31]Carole Delporte-Gallet, Hugues Fauconnier, Yan Jurski, François Laroussinie, Arnaud Sangnier
Towards Synthesis of Distributed Algorithms with SMT Solvers. NETYS 2019: 200-216 - 2018
- [j5]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Equivalence between model-checking flat counter systems and Presburger arithmetic. Theor. Comput. Sci. 735: 2-23 (2018) - 2017
- [c30]Normann Decker, Peter Habermehl, Martin Leucker
Model-Checking Counting Temporal Logics on Flat Structures. CONCUR 2017: 29:1-29:17 - [c29]Benedikt Bollig, Karin Quaas, Arnaud Sangnier
The Complexity of Flat Freeze LTL. CONCUR 2017: 33:1-33:16 - [c28]Arnaud Sangnier
Parameterized verification of algorithms for oblivious robots on a ring. FMCAD 2017: 212-219 - [i11]Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil:
Parameterized Verification of Algorithms for Oblivious Robots on a Ring. CoRR abs/1706.05193 (2017) - [i10]Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma:
Model-checking Counting Temporal Logics on Flat Structures. CoRR abs/1706.08608 (2017) - 2016
- [j4]Giorgio Delzanno, Arnaud Sangnier
Adding Data Registers to Parameterized Networks with Broadcast. Fundam. Informaticae 143(3-4): 287-316 (2016) - [j3]Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier
Parameterized verification of time-sensitive models of ad hoc network protocols. Theor. Comput. Sci. 612: 1-22 (2016) - [c27]Radu Iosif, Arnaud Sangnier
How Hard is It to Verify Flat Affine Counter Systems with the Finite Monoid Property? ATVA 2016: 89-105 - [c26]Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier
Qualitative Analysis of VASS-Induced MDPs. FoSSaCS 2016: 319-334 - [c25]Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier
Reachability in Networks of Register Protocols under Stochastic Schedulers. ICALP 2016: 106:1-106:14 - [i9]Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan:
Reachability in Networks of Register Protocols under Stochastic Schedulers. CoRR abs/1602.05928 (2016) - [i8]Radu Iosif, Arnaud Sangnier:
How hard is it to verify flat affine counter systems with the finite monoid property ? CoRR abs/1605.05836 (2016) - [i7]Benedikt Bollig, Karin Quaas, Arnaud Sangnier:
On Parameterized One-Counter Automata. CoRR abs/1609.06124 (2016) - 2015
- [j2]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Taming past LTL and flat counter systems. Inf. Comput. 242: 306-339 (2015) - [c24]Nathalie Bertrand
Distributed Local Strategies in Broadcast Networks. CONCUR 2015: 44-57 - [c23]François Laroussinie, Nicolas Markey
ATLsc with partial observation. GandALF 2015: 43-57 - [i6]Parosh Aziz Abdulla, Radu Ciobanu, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Qualitative Analysis of VASS-Induced MDPs. CoRR abs/1512.08824 (2015) - 2014
- [c22]Nathalie Bertrand
Playing with Probabilities in Reconfigurable Broadcast Networks. FoSSaCS 2014: 134-148 - [c21]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. RP 2014: 85-97 - 2013
- [c20]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier
Solving Parity Games on Integer Vectors. CONCUR 2013: 106-120 - [c19]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
On the Complexity of Verifying Regular Properties on Flat Counter Systems, . ICALP (2) 2013: 162-173 - [c18]Giorgio Delzanno, Arnaud Sangnier
Parameterized Verification of Broadcast Networks of Register Automata. RP 2013: 109-121 - [i5]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
On the Complexity of Verifying Regular Properties on Flat Counter Systems. CoRR abs/1304.6301 (2013) - [i4]Parosh Aziz Abdulla, Richard Mayr, Arnaud Sangnier, Jeremy Sproston:
Solving Parity Games on Integer Vectors. CoRR abs/1306.2806 (2013) - 2012
- [c17]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
Taming Past LTL and Flat Counter Systems. IJCAR 2012: 179-193 - [c16]Giorgio Delzanno, Arnaud Sangnier
Verification of Ad Hoc Networks with Node and Communication Failures. FMOODS/FORTE 2012: 235-250 - [c15]Giorgio Delzanno, Arnaud Sangnier
On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks. FSTTCS 2012: 289-300 - [c14]Nathalie Bertrand
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. RTA 2012: 101-116 - [i3]Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, Gianluigi Zavattaro:
The Cost of Parameterized Reachability in Mobile Ad Hoc Networks. CoRR abs/1202.5850 (2012) - [i2]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
Taming Past LTL and Flat Counter Systems. CoRR abs/1205.6584 (2012) - 2011
- [c13]Parosh Aziz Abdulla, Giorgio Delzanno, Othmane Rezine, Arnaud Sangnier
On the Verification of Timed Ad Hoc Networks. FORMATS 2011: 256-270 - [c12]Giorgio Delzanno, Arnaud Sangnier
On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. FoSSaCS 2011: 441-455 - [c11]Giorgio Delzanno, Arnaud Sangnier
Parameterized Verification of Safety Properties in Ad Hoc Network Protocols. PACO 2011: 56-65 - 2010
- [j1]Stéphane Demri, Ranko Lazic, Arnaud Sangnier
Model checking memoryful linear-time logics over one-counter automata. Theor. Comput. Sci. 411(22-24): 2298-2316 (2010) - [c10]Giorgio Delzanno, Arnaud Sangnier
Parameterized Verification of Ad Hoc Networks. CONCUR 2010: 313-327 - [c9]Stéphane Demri, Arnaud Sangnier
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. FoSSaCS 2010: 176-190 - [c8]Sébastien Labbé
Formal Verification of Industrial Software with Dynamic Memory Management. PRDC 2010: 77-84 - [c7]Alain Finkel, Arnaud Sangnier
Mixing Coverability and Reachability to Analyze VASS with One Zero-Test. SOFSEM 2010: 394-406
2000 – 2009
- 2009
- [c6]Pierre-Alain Reynier, Arnaud Sangnier
Weak Time Petri Nets Strike Back!. CONCUR 2009: 557-571 - [c5]Florent Bouchy, Alain Finkel, Arnaud Sangnier
Reachability in Timed Counter Systems. INFINITY 2009: 167-178 - 2008
- [c4]Stéphane Demri, Ranko Lazic, Arnaud Sangnier
Model Checking Freeze LTL over One-Counter Automata. FoSSaCS 2008: 490-504 - [c3]Alain Finkel, Arnaud Sangnier
Reversal-Bounded Counter Machines Revisited. MFCS 2008: 323-334 - [i1]Stéphane Demri, Ranko Lazic, Arnaud Sangnier:
Model checking memoryful linear-time logics over one-counter automata. CoRR abs/0810.5517 (2008) - 2007
- [c2]Alain Finkel, Étienne Lozes, Arnaud Sangnier
Towards Model-Checking Programs with Lists. ILC 2007: 56-86 - [c1]Davide D'Aprile, Susanna Donatelli, Arnaud Sangnier
From Time Petri Nets to Timed Automata: An Untimed Approach. TACAS 2007: 216-230
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: