2008 |
28 | 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 |
27 | EE | Jean-Christophe Filliâtre,
Claude Marché:
The Why/Krakatoa/Caduceus Platform for Deductive Program Verification.
CAV 2007: 173-177 |
26 | EE | Claude Marché:
Jessie: an intermediate language for Java and C verification.
PLPV 2007: 1-2 |
25 | EE | Claude Marché,
Hans Zantema:
The Termination Competition.
RTA 2007: 303-313 |
24 | EE | Claude Marché:
Towards Modular Algebraic Specifications for Pointer Programs: A Case Study.
Rewriting, Computation and Proof 2007: 235-258 |
2006 |
23 | EE | Claude Marché,
Nicolas Rousset:
Verification of JAVA CARD Applets Behavior with Respect to Transactions and Card Tears.
SEFM 2006: 137-146 |
2005 |
22 | EE | Thierry Hubert,
Claude Marché:
A case study of C source code verification: the Schorr-Waite algorithm.
SEFM 2005: 190-199 |
21 | EE | Claude Marché,
Christine Paulin-Mohring:
Reasoning About Java Programs with Aliasing and Frame Conditions.
TPHOLs 2005: 179-194 |
20 | EE | Salvador Lucas,
Claude Marché,
José Meseguer:
Operational termination of conditional term rewriting systems.
Inf. Process. Lett. 95(4): 446-453 (2005) |
19 | 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 |
18 | EE | Bart Jacobs,
Claude Marché,
Nicole Rauch:
Formal Verification of a Commercial Smart Card Applet with Multiple Tools.
AMAST 2004: 241-257 |
17 | EE | Jean-Christophe Filliâtre,
Claude Marché:
Multi-prover Verification of C Programs.
ICFEM 2004: 15-29 |
16 | EE | Francisco Durán,
Salvador Lucas,
José Meseguer,
Claude Marché,
Xavier Urbain:
Proving termination of membership equational programs.
PEPM 2004: 147-158 |
15 | 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) |
14 | EE | Claude Marché,
Xavier Urbain:
Modular and incremental proofs of AC-termination.
J. Symb. Comput. 38(1): 873-897 (2004) |
2001 |
13 | | Hubert Comon,
Claude Marché,
Ralf Treinen:
Constraints in Computational Logics: Theory and Applications, International Summer School, CCL'99 Gif-sur-Yvette, France, September 5-8, 1999, Revised Lectures
Springer 2001 |
2000 |
12 | | Enno Ohlebusch,
Claus Claves,
Claude Marché:
TALP: A Tool for the Termination Analysis of Logic Programs.
RTA 2000: 270-273 |
1998 |
11 | EE | Claude Marché,
Xavier Urbain:
Termination of Associative-Commutative Rewriting by Dependency Pairs.
RTA 1998: 241-255 |
1997 |
10 | | Evelyne Contejean,
Claude Marché,
Landy Rabehasaina:
Rewrite Systems for Natural, Integral, and Rational Arithmetic.
RTA 1997: 98-112 |
1996 |
9 | | Alexandre Boudet,
Evelyne Contejean,
Claude Marché:
AC-Complete Unification and its Application to Theorem Proving.
RTA 1996: 18-32 |
8 | | Evelyne Contejean,
Claude Marché:
CiME: Completion Modulo E.
RTA 1996: 416-419 |
7 | | Claude Marché:
Normalized Rewriting: An Alternative to Rewriting Modulo a Set of Equations.
J. Symb. Comput. 21(3): 253-288 (1996) |
1994 |
6 | | Claude Marché:
Normalised Rewriting and Normalised Completion
LICS 1994: 394-403 |
1993 |
5 | | Claude Marché:
Normalized Rewriting - Application to Ground Completion and Standard Bases.
Term Rewriting 1993: 154-169 |
1992 |
4 | | Claude Marché:
The Word Problem of ACD-Ground Theories is Undecidable.
Int. J. Found. Comput. Sci. 3(1): 81-97 (1992) |
3 | | Jean-Pierre Jouannaud,
Claude Marché:
Termination and Completion Modulo Associativity, Commutativity and Identity.
Theor. Comput. Sci. 104(1): 29-51 (1992) |
1991 |
2 | | Claude Marché:
On Ground AC-Completion.
RTA 1991: 411-422 |
1990 |
1 | | Jean-Pierre Jouannaud,
Claude Marché:
Completion modulo Associativity, Commutativity and Identity (AC1).
DISCO 1990: 111-120 |