Publications by year:
2011
| [BolVie11a] | Sylvie Boldo and Thierry Viéville. Représentation numérique de l’information. In Gilles Dowek, editor, Introduction à la science informatique, Repères pour agir, pages 23-72. CRDP Académie de Paris, July 2011. [ bib | http ] |
| [BolVie11b] | Sylvie Boldo and Thierry Viéville. Structuration et contrôle de l’information. In Gilles Dowek, editor, Introduction à la science informatique, Repères pour agir, pages 281-308. CRDP Académie de Paris, July 2011. [ bib | http ] |
| [BolMar11] | Sylvie Boldo and Claude Marché. Formal Verification of Numerical Programs: from C Annotated Programs to Mechanical Proofs. Mathematics in Computer Science, 5:377-393, 2011. [ bib | http ] |
| [BolNgu11] | Sylvie Boldo and Thi Minh Tuyen Nguyen. Proofs of numerical programs when the compiler optimizes. Innovations in Systems and Software Engineering, 7:1-10, March 2011. [ bib ] |
| [BolMul11] | Sylvie Boldo and Jean-Michel Muller. Exact and Approximated error of the FMA. IEEE Transactions on Computers, 60(2):157-164, February 2011. [ bib | http ] |
| [BolMel11] | Sylvie Boldo and Guillaume Melquiond. Flocq: A Unified Library for Proving Floating-point Algorithms in Coq. In Proceedings of the 20th IEEE Symposium on Computer Arithmetic, Tübingen, Germany, July 2011. [ bib ] |
2010
| [Bol10] | Sylvie Boldo. Formal verification of numerical programs: from C annotated programs to Coq proofs. In Proceedings of the Third International Workshop on Numerical Software Verification, Edinburgh, Scotland, 2010. NSV-8. [ bib | http ] |
| [BCF10] | Sylvie Boldo, François Clément, Jean-Christophe Filliâtre, Micaela Mayero, Guillaume Melquiond, and Pierre Weis. Formal Proof of a Wave Equation Resolution Scheme: the Method Error. In Matt Kaufmann and Lawrence C. Paulson, editors, Proceedings of the first Interactive Theorem Proving Conference (ITP), volume 6172 of LNCS, pages 147-162, Edinburgh, Scotland, July 2010. Springer. (merge of TPHOL and ACL2). [ bib | http ] |
| [BolNgu10] | Sylvie Boldo and Thi Minh Tuyen Nguyen. Hardware-independent proofs of numerical programs. In César Muñoz, editor, Proceedings of the Second NASA Formal Methods Symposium, number NASA/CP-2010-216215 in NASA Conference Publication, pages 14-23, Washington D.C., USA, April 2010. [ bib | .pdf ] |
| [Bol10_webtv] | Sylvie Boldo. L'informatique. Universcience web television, April 2010. Quiz 5-12. [ bib | .html ] |
| [Bol10_I1] | Sylvie Boldo. C'est la faute à l'ordinateur! Interstices - Idée reçue, February 2010. [ bib | http ] |
| [Bol10_I2] | Sylvie Boldo. Un algorithme de découpe de gâteau. Interstices, July 2010. [ bib | http ] |
2009
| [BFM09] | Sylvie Boldo, Jean-Christophe Filliâtre, and Guillaume Melquiond. Combining Coq and Gappa for Certifying Floating-Point Programs. In 16th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning, volume 5625 of Lecture Notes in Artificial Intelligence, pages 59-74, Grand Bend, Canada, July 2009. Springer. [ bib | DOI | .pdf ] |
| [Bol09b] | Sylvie Boldo. Floats & Ropes: a case study for formal numerical program verification. In 36th International Colloquium on Automata, Languages and Programming, volume 5556 of Lecture Notes in Computer Science - ARCoSS, pages 91-102, Rhodos, Greece, July 2009. Springer. [ bib | DOI | .pdf ] |
| [RZBG09] | Siegfried M. Rump, Paul Zimmermann, Sylvie Boldo, and Guillaume Melquiond. Computing predecessor and successor in rounding to nearest. BIT, 49(2):419-431, June 2009. [ bib | DOI | http ] |
| [Bol09_I] | Sylvie Boldo. Demandez le programme! Interstices, February 2009. [ bib | http ] |
| [BolDauLi09] | Sylvie Boldo, Marc Daumas, and Ren-Cang Li. Formally Verified Argument Reduction with a Fused-Multiply-Add. IEEE Transactions on Computers, 58(8):1139-1145, 2009. [ bib | DOI | http ] |
| [Bol09a] | Sylvie Boldo. Kahan's algorithm for a correct discriminant computation at last formally proven. IEEE Transactions on Computers, 58(2):220-225, February 2009. [ bib | DOI | http ] |
2008
| [Bol08DS] | Sylvie Boldo. Demandez le programme! In DocSciences, volume 5, pages 26-33. C.R.D.P. de l'académie de Versailles, November 2008. [ bib | http ] |
| [Bol08_I2] | Sylvie Boldo. L'informatique, ce n'est pas pour les filles. Interstices, September 2008. [ bib | http ] |
| [Bol08_I1] | Sylvie Boldo. Pourquoi mon ordinateur calcule-t-il faux? Interstices, April 2008. Podcast. [ bib | http ] |
| [BolMel08] | Sylvie Boldo and Guillaume Melquiond. Emulation of FMA and Correctly-Rounded Sums: Proved Algorithms Using Rounding to Odd. IEEE Transactions on Computers, 57(4):462-471, 2008. [ bib | DOI | http ] |
| [BolDauGio08] | Sylvie Boldo, Marc Daumas, and Pascal Giorgi. Formal proof for delayed finite field arithmetic using floating point operators. In Proceedings of the 8th Conference on Real Numbers and Computers, Santiago de Compostela, Spain, July 2008. [ bib | http ] |
2007
| [BolFil07] | Sylvie Boldo and Jean-Christophe Filliâtre. Formal Verification of Floating-Point Programs. In Peter Kornerup and Jean-Michel Muller, editors, Proceedings of the 18th IEEE Symposium on Computer Arithmetic, pages 187-194, Montpellier, France, June 2007. [ bib | DOI | .pdf ] |
2006
| [BDKM06] | Sylvie Boldo, Marc Daumas, William Kahan, and Guillaume Melquiond. Proof and certification for an accurate discriminant. In 12th IMACS-GAMM International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Duisburg,Germany, September 2006. [ bib | http ] |
| [Bol06a] | Sylvie Boldo. Pitfalls of a Full Floating-Point Proof: Example on the Formal Proof of the Veltkamp/Dekker Algorithms. In Proceedings of the third International Joint Conference on Automated Reasoning (IJCAR), pages 52-66, Seattle, USA, August 2006. [ bib | DOI ] |
| [Bol06b] | Sylvie Boldo. Formal Proofs about DSPs. In Bruno Buchberger, Shin'ichi Oishi, Michael Plum, and Sigfried M. Rump, editors, Algebraic and Numerical Algorithms and Computer-assisted Proofs, number 05391 in Dagstuhl Seminar Proceedings, Dagstuhl, Germany, 2006. Internationales Begegnungs- und Forschungszentrum (IBFI), Schloss Dagstuhl, Germany. [ bib | .pdf ] |
| [BolMun06] | Sylvie Boldo and César Muñoz. Provably Faithful Evaluation of Polynomials. In Proceedings of the 21st Annual ACM Symposium on Applied Computing, volume 2, pages 1328-1332, Dijon, France, April 2006. [ bib | DOI | http ] |
2005
| [BolMul05] | Sylvie Boldo and Jean-Michel Muller. Some Functions Computable with a Fused-mac. In Paolo Montuschi and Eric Schwarz, editors, Proceedings of the 17th Symposium on Computer Arithmetic, pages 52-58, Cape Cod, USA, 2005. [ bib | DOI | .pdf ] |
| [BolMel05] | Sylvie Boldo and Guillaume Melquiond. When double rounding is odd. In Proceedings of the 17th IMACS World Congress, Scientific Computation, Applied Mathematics and Simulation, Paris, France, 2005. [ bib | http ] |
2004
| [Bol04b] | Sylvie Boldo. Preuves formelles en arithmétiques à virgule flottante. PhD thesis, École Normale Supérieure de Lyon, November 2004. [ bib | .pdf ] |
| [BolDau04a] | Sylvie Boldo and Marc Daumas. Properties of two's complement floating point notations. International Journal on Software Tools for Technology Transfer, 5(2-3):237-246, 2004. [ bib | DOI | http ] |
| [BolDau04b] | Sylvie Boldo and Marc Daumas. A simple test qualifying the accuracy of Horner's rule for polynomials. Numerical Algorithms, 37(1-4):45-60, 2004. [ bib | DOI | http ] |
| [Bol04a] | Sylvie Boldo. Bridging the gap between formal specification and bit-level floating-point arithmetic. In Christiane Frougny, Vasco Brattka, and Norbert Müller, editors, Proceedings of the 6th Conference on Real Numbers and Computers, pages 22-36, Schloss Dagstuhl, Germany, 2004. [ bib | .pdf ] |
2003
| [BolDauThe03] | Sylvie Boldo, Marc Daumas, and Laurent Théry. Formal proofs and computations in finite precision arithmetic. In Proceedings of the 11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, pages 101-111, Roma, Italy, 2003. [ bib | .pdf ] |
| [LiBolDau03] | Ren-Cang Li, Sylvie Boldo, and Marc Daumas. Theorems on efficient argument reductions. In Jean-Claude Bajard and Michael Schulte, editors, Proceedings of the 16th Symposium on Computer Arithmetic, pages 129-136, Santiago de Compostela, Spain, 2003. [ bib | DOI | http ] |
| [BolDau03] | Sylvie Boldo and Marc Daumas. Representable correcting terms for possibly underflowing floating point operations. In Jean-Claude Bajard and Michael Schulte, editors, Proceedings of the 16th Symposium on Computer Arithmetic, pages 79-86, Santiago de Compostela, Spain, 2003. [ bib | DOI ] |
2002
| [BolDau02b] | Sylvie Boldo and Marc Daumas. Faithful rounding without fused multiply and accumulate. In Jean-Luc Lamotte and Fabien Rico, editors, Proceedings of the 10th IMACS-GAMM International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, page 161, Paris, France, 2002. [ bib ] |
| [BolDau02a] | Sylvie Boldo and Marc Daumas. Properties of the subtraction valid for any floating point system. In 7th International Workshop on Formal Methods for Industrial Critical Systems, pages 137-149, Málaga, Spain, 2002. Also in Electronic Notes in Theoretical Computer Science, volume 66(2). Elsevier, 2002. [ bib | DOI | .pdf ] |
| [Bol02] | Sylvie Boldo. Introduction à l'arithmétique des ordinateurs. In Forum des jeunes mathématiciennes et des jeunes informaticiennes, pages 7-10, Paris, France, 2002. [ bib ] |
2001
| [BolDau01b] | Sylvie Boldo and Marc Daumas. A mechanically validated technique for extending the available precision. In 35th Asilomar Conference on Signals, Systems, and Computers, pages 1299-1303, Pacific Grove, California, 2001. [ bib | DOI ] |
| [BolDau01a] | Sylvie Boldo and Marc Daumas. Performances d'implantations de l'addition en précision quad-double sur différentes machines. In 7ème Symposium sur les Architectures Nouvelles de Machines, pages 105-112, Paris, France, 2001. [ bib | .pdf ] |
This file was generated by bibtex2html 1.96.
