Slimmer Formal Proofs for Mathematical Libraries - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Slimmer Formal Proofs for Mathematical Libraries

Résumé

Short of being able to exhaustively test all the inputs, writing a formal proof offers the highest possible confidence in the correctness of a mathematical library. This comes at a large cost though, since formal proofs require taking into account all the details, even the seemingly insignificant ones, which makes them tedious to write. This issue is compounded by the fact that the objects whose properties we need to verify (floating-point numbers) are not the ones we would like to reason about (real numbers and integers). This short paper explores some ways of reducing the overhead of formal proofs in the setting of mathematical libraries, so as to let the user focus on the details that really matter.
Fichier principal
Vignette du fichier
article.pdf (212.26 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04165169 , version 1 (18-07-2023)

Licence

Paternité

Identifiants

  • HAL Id : hal-04165169 , version 1

Citer

Paul Geneau de Lamarlière, Guillaume Melquiond, Florian Faissole. Slimmer Formal Proofs for Mathematical Libraries. 30th IEEE International Symposium on Computer Arithmetic, Sep 2023, Portland (Oregon), United States. pp.4. ⟨hal-04165169⟩
82 Consultations
42 Téléchargements

Partager

Gmail Facebook X LinkedIn More