| * | 2009 |
|---|
| 18 | EE | Sylvie Boldo,
Jean-Christophe Filliâtre,
Guillaume Melquiond:
Combining Coq and Gappa for Certifying Floating-Point Programs.
Calculemus/MKM 2009: 59-74 |
| 17 | | Romain Bardou,
Jean-Christophe Filliâtre,
Johannes Kanig,
Stéphane Lescuyer:
Faire bonne figure avec Mlpost.
JFLA 2009: 477-507 |
| 2008 |
|---|
| 16 | EE | Sylvain Conchon,
Jean-Christophe Filliâtre:
Semi-persistent Data Structures.
ESOP 2008: 322-336 |
| 15 | EE | Jean-Christophe Filliâtre:
A functional implementation of the garsia--wachs algorithm: (functional pearl).
ML 2008: 91-96 |
| 2007 |
|---|
| 14 | EE | Jean-Christophe Filliâtre,
Claude Marché:
The Why/Krakatoa/Caduceus Platform for Deductive Program Verification.
CAV 2007: 173-177 |
| 13 | EE | Sylvie Boldo,
Jean-Christophe Filliâtre:
Formal Verification of Floating-Point Programs.
IEEE Symposium on Computer Arithmetic 2007: 187-194 |
| 12 | EE | Sylvain Conchon,
Jean-Christophe Filliâtre:
A persistent union-find data structure.
ML 2007: 37-46 |
| 11 | EE | Jean-Christophe Filliâtre:
Formal proof of a program: Find.
Sci. Comput. Program. 64(3): 332-340 (2007) |
| 2006 |
|---|
| 10 | | Jean-Christophe Filliâtre,
Christine Paulin-Mohring,
Benjamin Werner:
Types for Proofs and Programs, International Workshop, TYPES 2004, Jouy-en-Josas, France, December 15-18, 2004, Revised Selected Papers
Springer 2006 |
| 9 | EE | Jean-Christophe Filliâtre,
Sylvain Conchon:
Type-safe modular hash-consing.
ML 2006: 12-19 |
| 8 | EE | Jean-Christophe Filliâtre:
Backtracking iterators.
ML 2006: 55-62 |
| 2004 |
|---|
| 7 | EE | Jean-Christophe Filliâtre,
Pierre Letouzey:
Functors for Proofs and Programs.
ESOP 2004: 370-384 |
| 6 | EE | Jean-Christophe Filliâtre,
Claude Marché:
Multi-prover Verification of C Programs.
ICFEM 2004: 15-29 |
| 2003 |
|---|
| 5 | | Jean-Christophe Filliâtre:
Journées francophones des langages applicatifs (JFLA'03), Chamrousse, France, Janvier 2003
INRIA 2003 |
| 4 | EE | Jean-Christophe Filliâtre:
Verification of non-functional programs using interpretations in type theory.
J. Funct. Program. 13(4): 709-745 (2003) |
| 3 | EE | Jean-Christophe Filliâtre,
François Pottier:
Producing all ideals of a forest, functionally.
J. Funct. Program. 13(5): 945-956 (2003) |
| 2001 |
|---|
| 2 | EE | Jean-Christophe Filliâtre,
Sam Owre,
Harald Rueß,
Natarajan Shankar:
ICS: Integrated Canonizer and Solver.
CAV 2001: 246-249 |
| 1998 |
|---|
| 1 | EE | Jean-Christophe Filliâtre:
Proof of Imperative Programs in Type Theory.
TYPES 1998: 78-92 |
