A proof of GMP square root using the Coq assistant - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2002

A proof of GMP square root using the Coq assistant

(1) , (1) , (2)
1
2
Yves Bertot
Nicolas Magaud

Abstract

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.
Fichier principal
Vignette du fichier
RR-4475.pdf (365.05 Ko) Télécharger le fichier

Dates and versions

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

Identifiers

  • HAL Id : inria-00072113 , version 1

Cite

Yves Bertot, Nicolas Magaud, Paul Zimmermann. A proof of GMP square root using the Coq assistant. [Research Report] RR-4475, INRIA. 2002. ⟨inria-00072113⟩
317 View
3070 Download

Share

Gmail Facebook Twitter LinkedIn More