default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXavier Urbain
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j8]Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Swarms of Mobile Robots: Towards Versatility with Safety. Leibniz Trans. Embed. Syst. 8(2): 02:1-02:36 (2022)- 2021
- [c16]Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Computer Aided Formal Design of Swarm Robotics Algorithms. SSS 2021: 469-473 - [i5]Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Computer Aided Formal Design of Swarm Robotics Algorithms. CoRR abs/2101.06966 (2021)
2010 – 2019
- 2019
- [j7]Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil
, Xavier Urbain:
Synchronous Gathering without Multiplicity Detection: a Certified Algorithm. Theory Comput. Syst. 63(2): 200-218 (2019) - [c15]Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots. NETYS 2019: 93-109 - [p1]Maria Potop-Butucaru, Nathalie Sznajder, Sébastien Tixeuil, Xavier Urbain:
Formal Methods for Mobile Robots. Distributed Computing by Mobile Entities 2019: 278-313 - 2018
- [c14]Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots. SSS 2018: 404-408 - 2017
- [c13]Thibaut Balabonski, Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems. FMICS-AVoCS 2017: 165-181 - 2016
- [c12]Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Brief Announcement: Certified Universal Gathering in R2 for Oblivious Mobile Robots. PODC 2016: 439-441 - [c11]Thibaut Balabonski, Amélie Delga, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm. SSS 2016: 7-19 - [c10]Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots. DISC 2016: 187-200 - [i4]Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots. CoRR abs/1602.08361 (2016) - 2015
- [j6]Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
Impossibility of gathering, a certification. Inf. Process. Lett. 115(3): 447-452 (2015) - [i3]Pierre Courtieu, Lionel Rieg, Sébastien Tixeuil, Xavier Urbain:
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots. CoRR abs/1506.01603 (2015) - 2014
- [i2]Pierre Courtieu, Lionel Rieg, Xavier Urbain, Sébastien Tixeuil:
Impossibility of Gathering, a Certification. CoRR abs/1405.5902 (2014) - 2013
- [c9]Cédric Auger, Zohir Bouzid, Pierre Courtieu, Sébastien Tixeuil, Xavier Urbain:
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots. SSS 2013: 178-190 - [i1]Cédric Auger, Zohir Bouzid, Pierre Courtieu, Sébastien Tixeuil, Xavier Urbain:
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots. CoRR abs/1306.4242 (2013) - 2011
- [c8]Evelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain:
Automated Certified Proofs with CiME3. RTA 2011: 21-30 - 2010
- [c7]Evelyne Contejean, Andrey Paskevich, Xavier Urbain, Pierre Courtieu, Olivier Pons, Julien Forest:
A3PAT, an approach for certified automated termination proofs. PEPM 2010: 63-72
2000 – 2009
- 2008
- [j5]Francisco Durán, Salvador Lucas, Claude Marché, José Meseguer, Xavier Urbain:
Proving operational termination of membership equational programs. High. Order Symb. Comput. 21(1-2): 59-88 (2008) - [c6]Raúl Gutiérrez, Salvador Lucas, Xavier Urbain:
Usable Rules for Context-Sensitive Rewrite Systems. RTA 2008: 126-141 - [c5]Pierre Courtieu, Julien Forest, Xavier Urbain:
Certifying a Termination Criterion Based on Graphs, without Graphs. TPHOLs 2008: 183-198 - 2007
- [c4]Evelyne Contejean, Pierre Courtieu, Julien Forest, Olivier Pons, Xavier Urbain:
Certification of Automated Termination Proofs. FroCoS 2007: 148-162 - 2005
- [j4]Evelyne Contejean, Claude Marché, Ana Paula Tomás, Xavier Urbain:
Mechanically Proving Termination Using Polynomial Interpretations. J. Autom. Reason. 34(4): 325-363 (2005) - 2004
- [j3]Xavier Urbain:
Modular & Incremental Automated Termination Proofs. J. Autom. Reason. 32(4): 315-355 (2004) - [j2]Claude Marché, Christine Paulin-Mohring, Xavier Urbain:
The KRAKATOA tool for certificationof JAVA/JAVACARD programs annotated in JML. J. Log. Algebraic Methods Program. 58(1-2): 89-106 (2004) - [j1]Claude Marché, Xavier Urbain:
Modular and incremental proofs of AC-termination. J. Symb. Comput. 38(1): 873-897 (2004) - [c3]Francisco Durán, Salvador Lucas, José Meseguer, Claude Marché, Xavier Urbain:
Proving termination of membership equational programs. PEPM 2004: 147-158 - 2001
- [b1]Xavier Urbain:
Approche incrémentale des preuves automatiques de terminaison. (Incremental Approach for Automated Termination Proofs). University of Paris-Sud, Orsay, France, 2001 - [c2]Xavier Urbain:
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems. IJCAR 2001: 485-498
1990 – 1999
- 1998
- [c1]Claude Marché, Xavier Urbain:
Termination of Associative-Commutative Rewriting by Dependency Pairs. RTA 1998: 241-255
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-04-24 23:17 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:
