Sylvie Boldo
Présentation
Auto-magically brought to you by HAL.
Publications
Publications
Actes des Journées Francophones des Langages Applicatifs 2018INRIA, 2018 |
|
Computer Arithmetic and Formal ProofsISTE Press - Elsevier, pp.326, 2017, 9781785481123 |
|
Une introduction à la science informatique pour les enseignants de la discipline en lycéeGilles Dowek. CRDP Paris, pp.376, 2011, Repères pour agir (RPA disciplines & compétences), Christine Moulin, 978-2-86631-188-9 |
Même les ordinateurs font des erreurs !Martin Andler; Liliane Bel; Sylvie Benzoni-Gavage; Thierry Goudon; Cyril Imbert; Antoine Rousseau. Brèves de maths, Nouveau Monde Editions, pp.136-137, 2014, 978-2-36583-896-2 |
|
Arithmétique des ordinateurs et preuves formellesInformatique mathématique : Une photographie en 2013, 2013 |
|
|
Teaching Divisibility and Binomials with Coq13th International Workshop on Theorem proving components for Educational software - ThEdu 2024, Julien Narboux; Walther Neuper; Pedro Quaresma, Jul 2024, Nancy, France. pp.124 - 139, ⟨10.4204/EPTCS.419.8⟩ |
Generation of Pathological Cases for Rounding ErrorsRAIM Meeting 2025: 16th Rencontres de l'Arithmétique en Informatique Mathématique – A Tribute to Jean-Michel Muller, Nov 2025, Lyon, France |
|
|
|
A Coq Formalization of Lebesgue Induction Principle and Tonelli's Theorem25th International Symposium on Formal Methods (FM 2023), Mar 2023, Lübeck, Germany. pp.39--55, ⟨10.1007/978-3-031-27481-7_4⟩ |
|
|
Some Formal Tools for Computer Arithmetic: Flocq and GappaARITH 2021 - 28th IEEE International Symposium on Computer Arithmetic, Jun 2021, Online, Italy |
|
|
A Correctly-Rounded Fixed-Point-Arithmetic Dot-Product AlgorithmARITH 2020 - IEEE 27th Symposium on Computer Arithmetic, Jun 2020, Portland, United States. pp.9-16, ⟨10.1109/ARITH48897.2020.00011⟩ |
|
|
A Coq formalization of digital filtersCICM 2018 - 11th Conference on Intelligent Computer Mathematics, Aug 2018, Hagenberg, Austria. pp.87--103, ⟨10.1007/978-3-319-96812-4_8⟩ |
|
|
A Formally-Proved Algorithm to Compute the Correct Average of Decimal Floating-Point Numbers25th IEEE Symposium on Computer Arithmetic, Jun 2018, Amherst, MA, United States |
|
|
A Coq formal proof of the Lax–Milgram theorem6th ACM SIGPLAN Conference on Certified Programs and Proofs, Jan 2017, Paris, France. ⟨10.1145/3018610.3018625⟩ |
|
|
Formal Verification of a Floating-Point Expansion Renormalization Algorithm8th International Conference on Interactive Theorem Proving (ITP'2017), Sep 2017, Brasilia, Brazil |
|
|
Round-off Error Analysis of Explicit One-Step Numerical Integration Methods24th IEEE Symposium on Computer Arithmetic, Jul 2017, London, United Kingdom. ⟨10.1109/ARITH.2017.22⟩ |
|
|
Preuve formelle du théorème de Lax–Milgram16èmes journées Approches Formelles dans l'Assistance au Développement de Logiciels, Jun 2017, Montpellier, France |
|
|
Iterators: where folds failWorkshop on High-Consequence Control Verification, Jul 2016, Toronto, Canada |
|
|
Computing a correct and tight rounding error bound using rounding-to-nearest9th International Workshop on Numerical Software Verification, Jul 2016, Toronto, Canada |
|
|
Stupid is as Stupid Does: Taking the Square Root of the Square of a Floating-Point NumberSeventh and Eighth International Workshop on Numerical Software Verification, Apr 2015, Seattle, WA, United States. pp.50--55 |
|
|
Formal Verification of Programs Computing the Floating-Point Average17th International Conference on Formal Engineering Methods, Nov 2015, Paris, France. pp.17-32 |
|
|
Formal verification of tricky numerical computations16th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics, Sep 2014, Würzburg, Germany. pp.39 |
|
|
A Formally-Verified C Compiler Supporting Floating-Point ArithmeticArith - 21st IEEE Symposium on Computer Arithmetic, Apr 2013, Austin, United States. pp.107-115 |
|
|
How to Compute the Area of a Triangle: a Formal Revisit21st IEEE International Symposium on Computer Arithmetic, Apr 2013, Austin, TX, United States. pp.91-98, ⟨10.1109/ARITH.2013.29⟩ |
|
|
Improving Real Analysis in Coq: a User-Friendly Approach to Integrals and DerivativesCPP - 2nd International Conference on Certified Programs and Proofs - 2012, Dec 2012, Kyoto, Japan. pp.289-304, ⟨10.1007/978-3-642-35308-6_22⟩ |
|
|
Arithmétique des ordinateurs et preuves formellesÉcole des Jeunes Chercheurs en Informatique Mathématique, GDR Informatique Mathématique, Mar 2012, Rennes, France. pp.1-30 |
|
|
Flocq: A Unified Library for Proving Floating-point Algorithms in CoqProceedings of the 20th IEEE Symposium on Computer Arithmetic, Jul 2011, Tübingen, Germany. pp.243-252, ⟨10.1109/ARITH.2011.40⟩ |
|
|
Formal verification of numerical programs: from C annotated programs to Coq proofsNSV-3: Third International Workshop on Numerical Software Verification, Jul 2010, Edinburgh, Scotland, United Kingdom |
|
|
Formal proof of a wave equation resolution scheme: the method errorITP'10 - Interactive Theorem Proving, Jul 2010, Edinburgh, United Kingdom. pp.147-162, ⟨10.1007/978-3-642-14052-5_12⟩ |
|
|
Hardware-independent proofs of numerical programsSecond NASA Formal Methods Symposium (NFM 2010), NASA, Apr 2010, Washington D.C., United States. pp.14-23 |
|
|
Combining Coq and Gappa for Certifying Floating-Point Programs16th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning, Jul 2009, Grand Bend, Ontario, Canada. pp.59-74, ⟨10.1007/978-3-642-02614-0_10⟩ |
|
|
Formal proof for delayed finite field arithmetic using floating point operators8th Conference on Real Numbers and Computers, Jul 2008, Saint Jacques de Compostelle, Spain. pp.113-122 |
|
|
Provably Faithful Evaluation of Polynomials21st Annual ACM Symposium on Applied Computing, Apr 2006, Dijon, France |
|
|
Some Functions Computable with a Fused-mac17th IEEE Symposium on Computer Arithmetic, Jun 2005, Cape Cod, Massachusetts, USA, pp.52-58 |
|
|
When double rounding is odd17th IMACS World Congress, Jul 2005, Paris, France. pp.11 |
|
|
Theorems on Efficient Argument Reductions16th IEEE Symposium on Computer Arithmetic, 2003, Santiago de Compostela, Spain. pp.129-136, ⟨10.1109/ARITH.2003.1207670⟩ |
|
|
Properties of the subtraction valid for any floating point system7th International Workshop on Formal Methods for Industrial Critical Systems, 2002, Málaga, Spain. pp.137-149 |
|
|
Formal proofs of numerical programsForum Digitéo, Oct 2010, Palaiseau, France |
« Structures : organisation, complexité, dynamique » des mot-clés au sens inattendu2015 |
|
L'informatique2010 |
|
|
A Rocq Formalization of Monomial and Graded Orders2025 |
|
|
A Rocq Formalization of Simplicial Lagrange Finite Elements2025 |
|
|
How to Compute the Area of a Triangle: a Formal Revisit with a Tighter Error Bound2013 |
|
|
Computer validated proofs of a toolset for adaptable arithmetic2001 |
|
|
Code de Conduite du GDR-IFMGDR-IFM. 2026 |
|
|
A Rocq Formalization of Monomial and Graded OrdersRR-9604, INRIA. 2025, pp.17 |
|
|
A Rocq Formalization of Simplicial Lagrange Finite ElementsRR-9590, INRIA. 2025, pp.63 |
|
|
Teaching Divisibility and Binomials with CoqRR-9547, Inria. 2024, pp.13 |
|
|
Lebesgue Induction and Tonelli's Theorem in Coq[Research Report] RR-9457, Institut National de Recherche en Informatique et en Automatique (INRIA). 2023, pp.17 |
|
|
A Coq Formalization of the Bochner integral[Research Report] RR-9456, Inria Saclay - Île de France; Inria de Paris. 2022 |
|
|
A Coq Formalization of Lebesgue Integration of Nonnegative Functions[Research Report] RR-9401, Inria, France. 2021, pp.38 |
|
|
Médiation Scientifique : une facette de nos métiers de la recherche[Interne] Inria. 2013, pp.34 |
|
|
When double rounding is odd[Research Report] LIP RR-2004-48, Laboratoire de l'informatique du parallélisme. 2004, 2+7p |
|
|
Some Functions Computable with a Fused-mac[Research Report] LIP RR-2004-41, Laboratoire de l'informatique du parallélisme. 2004, 2+10p |
|
|
A simple test qualifying the accuracy of Horner's rule for polynomials[Research Report] LIP RR-2003-01, Laboratoire de l'informatique du parallélisme. 2003, 2+39p |
|
|
Necessary and sufficient conditions for exact floating point operations[Research Report] RR-4644, LIP RR-2002-44, INRIA, LIP. 2002 |
|
|
Deductive Formal Verification: How To Make Your Floating-Point Programs BehaveComputer Arithmetic. Université Paris-Sud, 2014 |