Formal Verification of a Floating-Point Expansion Renormalization Algorithm

Abstract : Many numerical problems require a higher computing precision than the one offered by standard floating-point formats. A common way of extending the precision is to use floating-point expansions. As the problems may be critical and as the algorithms used have very complex proofs (many sub-cases), a formal guarantee of correctness is a wish that can now be fulfilled, using interactive theorem proving. In this article we give a formal proof in Coq for one of the algorithms used as a basic brick when computing with floating-point expansions, the renormaliza-tion, which is usually applied after each operation. It is a critical step needed to ensure that the resulted expansion has the same property as the input one, and is more " compressed ". The formal proof uncovered several gaps in the pen-and-paper proof and gives the algorithm a very high level of guarantee.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées
Contributeur : Valentina Popescu <>
Soumis le : dimanche 23 avril 2017 - 00:52:53
Dernière modification le : jeudi 15 juin 2017 - 09:09:27


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01512417, version 1



Sylvie Boldo, Mioara Joldes, Jean-Michel Muller, Valentina Popescu. Formal Verification of a Floating-Point Expansion Renormalization Algorithm. 2017. <hal-01512417>



Consultations de
la notice


Téléchargements du document