Formal proof for delayed finite field arithmetic using floating point operators - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2007

Formal proof for delayed finite field arithmetic using floating point operators

Résumé

Formal proof checkers such as Coq are capable of validating proofs of correction of algorithms for finite field arithmetics but they require extensive training from potential users. The delayed solution of a triangular system over a finite field mixes operations on integers and operations on floating point numbers. We focus in this report on proof obligations that state that no round off error occurred on any of the floating point operations. We use a tool named Gappa that can be learned in a matter of minutes to generate proofs related to floating point arithmetic and hide technicalities of formal proof checkers.
Fichier principal
Vignette du fichier
hal.pdf (233.67 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00135090 , version 1 (06-03-2007)
hal-00135090 , version 2 (24-05-2007)
hal-00135090 , version 3 (14-05-2008)

Identifiants

Citer

Marc Daumas, Pascal Giorgi. Formal proof for delayed finite field arithmetic using floating point operators. 2007. ⟨hal-00135090v2⟩
385 Consultations
188 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More