A proof of GMP square root using the Coq assistant - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2002

A proof of GMP square root using the Coq assistant

Yves Bertot
Nicolas Magaud

Résumé

We present a formal proof (at the implementation level) of an efficient algorithm proposed in to compute square roots of arbitrarily large integers. This program, which is part of the GNU Multiple Precision Arithmetic Library (GMP), is completely proven within the system. Proofs are developed using the Correctness tool to deal with imperative features of the program. The formalization is rather large (more than 13000 lines) and requires some advanced techniques for proof management and reuse.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4475.pdf (365.05 Ko) Télécharger le fichier

Dates et versions

inria-00072113 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00072113 , version 1

Citer

Yves Bertot, Nicolas Magaud, Paul Zimmermann. A proof of GMP square root using the Coq assistant. [Research Report] RR-4475, INRIA. 2002. ⟨inria-00072113⟩
348 Consultations
4016 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More