2008 |
11 | EE | Raúl Gutiérrez,
Salvador Lucas,
Xavier Urbain:
Usable Rules for Context-Sensitive Rewrite Systems.
RTA 2008: 126-141 |
10 | EE | Pierre Courtieu,
Julien Forest,
Xavier Urbain:
Certifying a Termination Criterion Based on Graphs, without Graphs.
TPHOLs 2008: 183-198 |
9 | EE | Francisco Durán,
Salvador Lucas,
Claude Marché,
José Meseguer,
Xavier Urbain:
Proving operational termination of membership equational programs.
Higher-Order and Symbolic Computation 21(1-2): 59-88 (2008) |
2007 |
8 | EE | Evelyne Contejean,
Pierre Courtieu,
Julien Forest,
Olivier Pons,
Xavier Urbain:
Certification of Automated Termination Proofs.
FroCos 2007: 148-162 |
2005 |
7 | EE | Evelyne Contejean,
Claude Marché,
Ana Paula Tomás,
Xavier Urbain:
Mechanically Proving Termination Using Polynomial Interpretations.
J. Autom. Reasoning 34(4): 325-363 (2005) |
2004 |
6 | EE | Francisco Durán,
Salvador Lucas,
José Meseguer,
Claude Marché,
Xavier Urbain:
Proving termination of membership equational programs.
PEPM 2004: 147-158 |
5 | | Xavier Urbain:
Modular & Incremental Automated Termination Proofs.
Int. J. Approx. Reasoning 32(4): 315-355 (2004) |
4 | EE | Claude Marché,
Christine Paulin-Mohring,
Xavier Urbain:
The KRAKATOA tool for certificationof JAVA/JAVACARD programs annotated in JML.
J. Log. Algebr. Program. 58(1-2): 89-106 (2004) |
3 | EE | Claude Marché,
Xavier Urbain:
Modular and incremental proofs of AC-termination.
J. Symb. Comput. 38(1): 873-897 (2004) |
2001 |
2 | EE | Xavier Urbain:
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems.
IJCAR 2001: 485-498 |
1998 |
1 | EE | Claude Marché,
Xavier Urbain:
Termination of Associative-Commutative Rewriting by Dependency Pairs.
RTA 1998: 241-255 |