A proof of GMP square root using the Coq assistant

Yves Bertot 1 Nicolas Magaud 1 Paul Zimmermann 2
1 LEMME - Software and mathematics
CRISAM - Inria Sophia Antipolis - Méditerranée
2 SPACES - Solving problems through algebraic computation and efficient software
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00072113
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:49:22 PM
Last modification on : Monday, September 3, 2018 - 10:56:02 AM
Long-term archiving on : Sunday, April 4, 2010 - 10:53:56 PM

Identifiers

  • HAL Id : inria-00072113, version 1

Collections

Citation

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

Share

Metrics

Record views

537

Files downloads

926