A proof of GMP square root using the Coq assistant
Yves Bertot, Nicolas Magaud, Paul A. Zimmermann · INRIA a CCSD electronic archive server · 2002
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.