Primitive Floats in Coq - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Primitive Floats in Coq

Flottants primitifs en Coq

Résumé

Some mathematical proofs involve intensive computations, for instance: the four-color theorem, Hales' theorem on sphere packing (formerly known as the Kepler conjecture) or interval arithmetic. For numerical computations, floating-point arithmetic enjoys widespread usage thanks to its efficiency, despite the introduction of rounding errors. Formal guarantees can be obtained on floating-point algorithms based on the IEEE 754 standard, which precisely specifies floating-point arithmetic and its rounding modes, and a proof assistant such as Coq, that enjoys efficient computation capabilities. Coq offers machine integers, however floating-point arithmetic still needed to be emulated using these integers. A modified version of Coq is presented that enables using the machine floating-point operators. The main obstacles to such an implementation and its soundness are discussed. Benchmarks show potential performance gains of two orders of magnitude.
Fichier principal
Vignette du fichier
DTIS20008.1579256435.pdf (625.1 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02449191 , version 1 (22-01-2020)

Licence

Paternité

Identifiants

Citer

Guillaume Bertholon, Érik Martin-Dorel, Pierre Roux. Primitive Floats in Coq. ITP 2019, Interactive Theorem Proving, Sep 2019, PORTLAND, United States. ⟨10.4230/LIPIcs.ITP.2019.7⟩. ⟨hal-02449191⟩
101 Consultations
196 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More