A Proof of GMP Square Root - Archive ouverte HAL Access content directly
Journal Articles Journal of Automated Reasoning Year : 2002

A Proof of GMP Square Root

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

Abstract

We present a formal proof (at the implementation level) of an efficient algorithm proposed by Paul Zimmermann \cite{Zimmermann2000} to compute square roots of arbitrary large integers. This program, which is part of the GNU Multiple Precision Arithmetic Library (GMP) is completely proven within the Coq 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.

Dates and versions

inria-00101044 , version 1 (26-09-2006)

Identifiers

Cite

Yves Bertot, Nicolas Magaud, Paul Zimmermann. A Proof of GMP Square Root. Journal of Automated Reasoning, 2002, 29 (3-4), pp.225--252. ⟨10.1023/A:1021987403425⟩. ⟨inria-00101044⟩
139 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More