 | 2011 |
| 24 |  | Sylvie Boldo,
Guillaume Melquiond:
Flocq: A Unified Library for Proving Floating-Point Algorithms in Coq.
IEEE Symposium on Computer Arithmetic 2011: 243-252 |
| 23 |  | Sylvie Boldo,
François Clément,
Jean-Christophe Filliâtre,
Micaela Mayero,
Guillaume Melquiond,
Pierre Weis:
Wave Equation Numerical Resolution: Mathematics and Program
CoRR abs/1112.1795: (2011) |
| 22 |  | Sylvie Boldo,
Jean-Michel Muller:
Exact and Approximated Error of the FMA.
IEEE Trans. Computers 60(2): 157-164 (2011) |
| 21 |  | Sylvie Boldo,
Thi Minh Tuyen Nguyen:
Proofs of numerical programs when the compiler optimizes.
ISSE 7(2): 151-160 (2011) |
| 20 |  | Sylvie Boldo,
Claude Marché:
Formal Verification of Numerical Programs: From C Annotated Programs to Mechanical Proofs.
Mathematics in Computer Science 5(4): 377-393 (2011) |
| 2010 |
| 19 |  | Sylvie Boldo,
François Clément,
Jean-Christophe Filliâtre,
Micaela Mayero,
Guillaume Melquiond,
Pierre Weis:
Formal Proof of a Wave Equation Resolution Scheme: The Method Error.
ITP 2010: 147-162 |
| 18 |  | Sylvie Boldo,
François Clément,
Jean-Christophe Filliâtre,
Micaela Mayero,
Guillaume Melquiond,
Pierre Weis:
Formal Proof of a Wave Equation Resolution Scheme: the Method Error
CoRR abs/1001.4898: (2010) |
| 17 |  | Sylvie Boldo,
François Clément,
Jean-Christophe Filliâtre,
Micaela Mayero,
Guillaume Melquiond,
Pierre Weis:
Formal Proof of a Wave Equation Resolution Scheme: the Method Error
CoRR abs/1005.0824: (2010) |
| 2009 |
| 16 |  | Sylvie Boldo,
Jean-Christophe Filliâtre,
Guillaume Melquiond:
Combining Coq and Gappa for Certifying Floating-Point Programs.
Calculemus/MKM 2009: 59-74 |
| 15 |  | Sylvie Boldo:
Floats and Ropes: A Case Study for Formal Numerical Program Verification.
ICALP (2) 2009: 91-102 |
| 14 |  | Sylvie Boldo:
Kahan's Algorithm for a Correct Discriminant Computation at Last Formally Proven.
IEEE Trans. Computers 58(2): 220-225 (2009) |
| 13 |  | Sylvie Boldo,
Marc Daumas,
Ren-Cang Li:
Formally Verified Argument Reduction with a Fused Multiply-Add.
IEEE Trans. Computers 58(8): 1139-1145 (2009) |
| 2008 |
| 12 |  | Sylvie Boldo,
Guillaume Melquiond:
Emulation of a FMA and Correctly Rounded Sums: Proved Algorithms Using Rounding to Odd.
IEEE Trans. Computers 57(4): 462-471 (2008) |
| 2007 |
| 11 |  | Sylvie Boldo,
Jean-Christophe Filliâtre:
Formal Verification of Floating-Point Programs.
IEEE Symposium on Computer Arithmetic 2007: 187-194 |
| 10 |  | Sylvie Boldo,
Marc Daumas,
Ren-Cang Li:
Formally Verified Argument Reduction with a Fused-Multiply-Add
CoRR abs/0708.3722: (2007) |
| 2006 |
| 9 |  | Sylvie Boldo:
Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms.
IJCAR 2006: 52-66 |
| 8 |  | Sylvie Boldo,
César Muñoz:
Provably faithful evaluation of polynomials.
SAC 2006: 1328-1332 |
| 2005 |
| 7 |  | Sylvie Boldo,
Jean-Michel Muller:
Some Functions Computable with a Fused-Mac.
IEEE Symposium on Computer Arithmetic 2005: 52-58 |
| 2004 |
| 6 |  | Sylvie Boldo,
Marc Daumas:
A Simple Test Qualifying the Accuracy of Horner'S Rule for Polynomials.
Numerical Algorithms 37(1-4): 45-60 (2004) |
| 5 |  | Sylvie Boldo,
Marc Daumas:
Properties of two's complement floating point notations.
STTT 5(2-3): 237-246 (2004) |
| 2003 |
| 4 |  | Ren-Cang Li,
Sylvie Boldo,
Marc Daumas:
Theorems on Efficient Argument Reductions.
IEEE Symposium on Computer Arithmetic 2003: 129-136 |
| 3 |  | Sylvie Boldo,
Marc Daumas:
Representable Correcting Terms for Possibly Underflowing Floating Point Operations.
IEEE Symposium on Computer Arithmetic 2003: 79-86 |
| 2002 |
| 2 |  | Sylvie Boldo,
Marc Daumas:
Properties of the subtraction valid for any floating point system.
Electr. Notes Theor. Comput. Sci. 66(2): 132-144 (2002) |
| 2001 |
| 1 |  | Sylvie Boldo,
Marc Daumas,
Claire Moreau-Finot,
Laurent Théry:
Computer validated proofs of a toolset for adaptable arithmetic
CoRR cs.MS/0107025: (2001) |