Xavier Urbain
Xavier Urbain
Full Professor of Computer Science, University Claude Bernard Lyon 1
Dirección de correo verificada de liris.cnrs.fr
Título
Citado por
Citado por
Año
The Krakatoa tool for certification of Java/JavaCard Programs annotated in JML
C Marché, C Paulin-Mohring, X Urbain
The Journal of Logic and Algebraic Programming 58 (1), 89-106, 2004
2612004
Mechanically proving termination using polynomial interpretations
E Contejean, C Marché, AP Tomás, X Urbain
Journal of Automated Reasoning 34 (4), 325-363, 2005
1112005
Proving operational termination of membership equational programs
F Durán, S Lucas, C Marché, J Meseguer, X Urbain
Higher-Order and Symbolic Computation 21 (1-2), 59-88, 2008
942008
Certification of automated termination proofs
E Contejean, P Courtieu, J Forest, O Pons, X Urbain
International Symposium on Frontiers of Combining Systems, 148-162, 2007
672007
Modular and incremental automated termination proofs
X Urbain
Journal of Automated Reasoning 32 (4), 315-355, 2004
622004
Proving termination of membership equational programs
F Durán, S Lucas, J Meseguer, C Marché, X Urbain
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and …, 2004
592004
Proving termination of rewriting with CiME
E Contejean, C Marché, B Monate, X Urbain
Extended Abstracts of the 6th International Workshop on Termination, WST’03 …, 2003
532003
Automated certified proofs with CiME3
E Contejean, P Courtieu, J Forest, O Pons, X Urbain
Rewriting Techniques and Applications (RTA 22) 10, 21-30, 2011
482011
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots
C Auger, Z Bouzid, P Courtieu, S Tixeuil, X Urbain
arXiv preprint arXiv:1306.4242, 2013
432013
CiME version 2, 2000
E Contejean, C Marché, B Monate, X Urbain
42
A3PAT, an approach for certified automated termination proofs
É Contejean, A Paskevich, X Urbain, P Courtieu, O Pons, J Forest
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and …, 2010
402010
Termination of associative-commutative rewriting by dependency pairs
C Marché, X Urbain
Rewriting Techniques and Applications: 9th International Conference, RTA-98 …, 1998
331998
Impossibility of gathering, a certification
P Courtieu, L Rieg, S Tixeuil, X Urbain
Information Processing Letters 115 (3), 447-452, 2015
322015
Modular and incremental proofs of AC-termination
C Marché, X Urbain
Journal of Symbolic Computation 38 (1), 873-897, 2004
302004
Automated incremental termination proofs for hierarchically defined term rewriting systems
X Urbain
International Joint Conference on Automated Reasoning, 485-498, 2001
292001
CiME version 2
E Contejean, C Marché, B Monate, X Urbain
Prerelease available at http://www. lri. fr/~ demons/cime. html, 2000
28*2000
Certified universal gathering in R2 for oblivious mobile robots
P Courtieu, L Rieg, S Tixeuil, X Urbain
30th International Symposium on Distributed Computing (DISC 2016), Paris …, 2016
25*2016
Usable rules for context-sensitive rewrite systems
R Gutiérrez, S Lucas, X Urbain
International Conference on Rewriting Techniques and Applications, 126-141, 2008
182008
Synchronous gathering without multiplicity detection: A certified algorithm
T Balabonski, A Delga, L Rieg, S Tixeuil, X Urbain
Theory of Computing Systems 63 (2), 200-218, 2019
172019
Synchronous Gathering Without Multiplicity Detection: A Certified Algorithm
T Balabonski, A Delga, L Rieg, S Tixeuil, X Urbain
International Symposium on Stabilization, Safety, and Security of …, 2016
172016
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20