Author Info
Name
Affiliation
Papers
XAVIER URBAIN
INRIA Futurs, Université Paris-Sud, France
22
Collaborators
Citations 
PageRank 
22
286
16.54
Referers 
Referees 
References 
235
267
357
Search Limit
100267
Title
Citations
PageRank
Year
Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm.50.432019
Continuous vs. Discrete Asynchronous Moves - A Certified Approach for Mobile Robots.00.342019
Brief Announcement Continuous Vs. Discrete Asynchronous Moves: A Certified Approach For Mobile Robots00.342018
Certified Gathering of Oblivious Mobile Robots: Survey of Recent Results and Open Problems.00.342017
Certified Universal Gathering in \mathbb R ^2 for Oblivious Mobile Robots.00.342016
Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots.80.502016
Brief Announcement: Certified Universal Gathering in R2 for Oblivious Mobile Robots.10.352016
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots40.432015
Impossibility of gathering, a certification.170.862014
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots160.842013
Automated Certified Proofs with CiME3140.622011
A3PAT, an approach for certified automated termination proofs170.742010
Proving operational termination of membership equational programs320.962008
Certifying a Termination Criterion Based on Graphs, without Graphs80.692008
Usable Rules for Context-Sensitive Rewrite Systems40.412008
Certification of Automated Termination Proofs291.232007
Mechanically Proving Termination Using Polynomial Interpretations521.882005
Proving termination of membership equational programs281.292004
Modular and Incremental Automated Termination Proofs141.092004
Modular and incremental proofs of AC-termination130.642004
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems101.012001
Termination of Associative-Commutative Rewriting by Dependency Pairs141.221998