The SCEAS System
Navigation Menu

Search the dblp DataBase


Claude Marché: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  27. Multi-Prover Verification of Floating-Point Programs. [Citation Graph (, )][DBLP]

Search in 0.003secs, Finished in 0.005secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002