( en | de | ru )

 

Disambiguation of "Urbain, Xavier"

Author of the publication

copydeleteadd this publication to your clipboard
Proving termination of membership equational programs.

, , , , and . PEPM, page 147-158. ACM, (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Paul Urbain

Pol Urbain

Marianne Urbain

Peter Urbain

Wozan Urbain N'Dakon

 

Other publications of authors with the same name

Certifying a Termination Criterion Based on Graphs, without Graphs., , and . TPHOLs, volume 5170 of Lecture Notes in Computer Science, page 183-198. Springer, (2008)Modular & Incremental Automated Termination Proofs.. J. Autom. Reason., 32 (4): 315-355 (2004)Mechanically Proving Termination Using Polynomial Interpretations., , , and . J. Autom. Reason., 34 (4): 325-363 (2005)Modular and incremental proofs of AC-termination., and . J. Symb. Comput., 38 (1): 873-897 (2004)Computer Aided Formal Design of Swarm Robotics Algorithms., , , , , and . SSS, volume 13046 of Lecture Notes in Computer Science, page 469-473. Springer, (2021)Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots., , , , , and . NETYS, volume 11704 of Lecture Notes in Computer Science, page 93-109. Springer, (2019)A3PAT, an approach for certified automated termination proofs., , , , , and . PEPM, page 63-72. ACM, (2010)Usable Rules for Context-Sensitive Rewrite Systems., , and . RTA, volume 5117 of Lecture Notes in Computer Science, page 126-141. Springer, (2008)Synchronous Gathering without Multiplicity Detection: a Certified Algorithm., , , , and . Theory Comput. Syst., 63 (2): 200-218 (2019)Approche incrémentale des preuves automatiques de terminaison. (Incremental Approach for Automated Termination Proofs).. University of Paris-Sud, Orsay, France, (2001)