default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathalie Sznajder
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, Mathieu Lehaut
, Nathalie Sznajder:
Round- and context-bounded control of dynamic pushdown systems. Formal Methods Syst. Des. 62(1): 41-78 (2024)- [c16]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Safety Verification of Wait-Only Non-Blocking Broadcast Protocols. Petri Nets 2024: 291-311 - [c15]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Phase-Bounded Broadcast Networks over Topologies of Communication. CONCUR 2024: 26:1-26:16 - [i9]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Safety Verification of Wait-Only Non-Blocking Broadcast Protocols. CoRR abs/2403.18591 (2024) - [i8]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Phase-Bounded Broadcast Networks over Topologies of Communication. CoRR abs/2406.15202 (2024) - 2023
- [c14]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. CONCUR 2023: 7:1-7:17 - [i7]Lucie Guillou, Arnaud Sangnier, Nathalie Sznajder:
Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous. CoRR abs/2307.04546 (2023) - 2022
- [j7]Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder:
Synthesis in presence of dynamic links. Inf. Comput. 289(Part): 104856 (2022) - 2020
- [j6]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): 55-89 (2020) - [c13]Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
Parameterized Synthesis for Fragments of First-Order Logic Over Data Words. FoSSaCS 2020: 97-118 - [c12]Yackolley Amoussou-Guenou, Souheib Baarir, Maria Potop-Butucaru, Nathalie Sznajder, Léo Tible, Sébastien Tixeuil:
On the Encoding and Solving of Partial Information Games. NETYS 2020: 60-76 - [c11]Béatrice Bérard, Benedikt Bollig, Patricia Bouyer, Matthias Függer, Nathalie Sznajder:
Synthesis in Presence of Dynamic Links. GandALF 2020: 33-49
2010 – 2019
- 2019
- [p1]Maria Potop-Butucaru, Nathalie Sznajder, Sébastien Tixeuil, Xavier Urbain:
Formal Methods for Mobile Robots. Distributed Computing by Mobile Entities 2019: 278-313 - [i6]Béatrice Bérard, Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
Parameterized Synthesis for Fragments of First-Order Logic over Data Words. CoRR abs/1910.14294 (2019) - 2018
- [c10]Benedikt Bollig, Mathieu Lehaut, Nathalie Sznajder:
Round-Bounded Control of Parameterized Systems. ATVA 2018: 370-386 - 2017
- [c9]Arnaud Sangnier, Nathalie Sznajder, Maria Potop-Butucaru, Sébastien Tixeuil:
Parameterized verification of algorithms for oblivious robots on a ring. FMCAD 2017: 212-219 - [i5]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) - 2016
- [c8]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! FORMATS 2016: 105-120 - [i4]Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, Nathalie Sznajder:
Real-Time Synthesis is Hard! CoRR abs/1606.07124 (2016) - 2015
- [j5]Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder:
Probabilistic opacity for Markov decision processes. Inf. Process. Lett. 115(1): 52-59 (2015) - 2014
- [j4]Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
On regions and zones for event-clock automata. Formal Methods Syst. Des. 45(3): 330-380 (2014) - [c7]Laure Millet, Maria Potop-Butucaru, Nathalie Sznajder, Sébastien Tixeuil:
On the Synthesis of Mobile Robots Algorithms: The Case of Ring Gathering. SSS 2014: 237-251 - [i3]Laure Millet, Maria Potop-Butucaru, Nathalie Sznajder, Sébastien Tixeuil:
On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering. CoRR abs/1407.0978 (2014) - [i2]Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder:
Probabilistic Opacity for Markov Decision Processes. CoRR abs/1407.4225 (2014) - 2013
- [j3]Paul Gastin, Nathalie Sznajder:
Fair Synthesis for Asynchronous Distributed Systems. ACM Trans. Comput. Log. 14(2): 9:1-9:31 (2013) - 2012
- [j2]Paul Gastin, Nathalie Sznajder:
Decidability of well-connectedness for distributed synthesis. Inf. Process. Lett. 112(24): 963-968 (2012) - [c6]Béatrice Bérard, Serge Haddad, Mathieu Sassolas, Nathalie Sznajder:
Concurrent Games on VASS with Inhibition. CONCUR 2012: 39-52 - 2011
- [c5]Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
Event Clock Automata: From Theory to Practice. FORMATS 2011: 209-224 - [i1]Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
Event-Clock Automata: From Theory to Practice. CoRR abs/1107.4138 (2011) - 2010
- [c4]Barbara Di Giampaolo, Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder:
Safraless Procedures for Timed Specifications. FORMATS 2010: 2-22
2000 – 2009
- 2009
- [j1]Paul Gastin, Nathalie Sznajder, Marc Zeitoun:
Distributed synthesis for well-connected architectures. Formal Methods Syst. Des. 34(3): 215-237 (2009) - [c3]Thomas Chatain, Paul Gastin, Nathalie Sznajder:
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. SOFSEM 2009: 141-152 - 2007
- [c2]Alessandro Abate, Yu Bai, Nathalie Sznajder, Carolyn L. Talcott, Ashish Tiwari:
Quantitative and Probabilistic Modeling in Pathway Logic. BIBE 2007: 922-929 - 2006
- [c1]Paul Gastin, Nathalie Sznajder, Marc Zeitoun:
Distributed Synthesis for Well-Connected Architectures. FSTTCS 2006: 321-332
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-12-10 21:48 CET 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:
