Travelled to:
1 × Cyprus
1 × India
1 × Japan
1 × Spain
1 × USA
2 × France
2 × Germany
2 × Italy
2 × United Kingdom
Collaborated with:
E.Contejean ∅ X.Urbain A.Ayad J.Filliâtre H.Zantema N.Rousset T.Hubert E.Ohlebusch C.Claves L.Rabehasaina A.Boudet M.Clochard A.Paskevich A.Giorgetti E.Tushkanova O.Kouchnarenko F.Durán S.Lucas J.Meseguer
Talks about:
program (5) verif (5) complet (4) termin (4) rewrit (3) normalis (2) deduct (2) studi (2) prove (2) java (2)
Person: Claude Marché
DBLP: March=eacute=:Claude
Contributed to:
Wrote 15 papers:
- IJCAR-2010-AyadM #float #multi #source code #verification
- Multi-Prover Verification of Floating-Point Programs (AA, CM), pp. 127–141.
- LDTA-2010-GiorgettiMTK #case study #java #source code #specification
- Specifying generic Java programs: two case studies (AG, CM, ET, OK), p. 8.
- CAV-2007-FilliatreM #deduction #framework #platform #verification #why
- The Why/Krakatoa/Caduceus Platform for Deductive Program Verification (JCF, CM), pp. 173–177.
- RTA-2007-MarcheZ #contest #termination
- The Termination Competition (CM, HZ), pp. 303–313.
- SEFM-2006-MarcheR #behaviour #java #transaction #verification
- Verification of JAVA CARD Applets Behavior with Respect to Transactions and Card Tears (CM, NR), pp. 137–146.
- SEFM-2005-HubertM #algorithm #c #case study #source code #verification
- A case study of C source code verification: the Schorr-Waite algorithm (TH, CM), pp. 190–199.
- PEPM-2004-DuranLMMU #equation #proving #source code #termination
- Proving termination of membership equational programs (FD, SL, JM, CM, XU), pp. 147–158.
- RTA-2000-OhlebuschCM #analysis #logic programming #named #source code #termination
- TALP: A Tool for the Termination Analysis of Logic Programs (EO, CC, CM), pp. 270–273.
- RTA-1998-MarcheU #commutative #dependence #termination
- Termination of Associative-Commutative Rewriting by Dependency Pairs (CM, XU), pp. 241–255.
- RTA-1997-ContejeanMR #term rewriting
- Rewrite Systems for Natural, Integral, and Rational Arithmetic (EC, CM, LR), pp. 98–112.
- RTA-1996-BoudetCM #proving #theorem proving #unification
- AC-Complete Unification and its Application to Theorem Proving (AB, EC, CM), pp. 18–32.
- RTA-1996-ContejeanM #named
- CiME: Completion Modulo E (EC, CM), pp. 416–419.
- LICS-1994-Marche #normalisation
- Normalised Rewriting and Normalised Completion (CM), pp. 394–403.
- RTA-1991-Marche #on the
- On Ground AC-Completion (CM), pp. 411–422.
- POPL-2020-ClochardMP #deduction #monitoring #verification
- Deductive verification with ghost monitors (MC, CM, AP), p. 26.