WhyMP, a Formally Verified Arbitrary-Precision Integer Library - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Symbolic Computation Year : 2023

WhyMP, a Formally Verified Arbitrary-Precision Integer Library

Abstract

Arbitrary-precision integer libraries such as GMP are a critical building block of computer algebra systems. GMP provides state-of-the-art algorithms that are intricate enough to justify formal verification. In this paper, we present a C library that has been formally verified using the Why3 verification platform in about four person-years. This verification deals not only with safety, but with full functional correctness. It has been performed using a mixture of mechanically checked handwritten proofs and automated theorem proving. We have implemented and verified a nontrivial subset of GMP's algorithms, including their optimizations and intricacies. Our library provides the same interface as GMP and is almost as efficient for smaller inputs. We detail our verification methodology and the algorithms we have implemented, and include some benchmarks to compare our library with GMP.
Fichier principal
Vignette du fichier
main.pdf (390.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03233220 , version 1 (24-05-2021)

Identifiers

Cite

Guillaume Melquiond, Raphaël Rieu-Helft. WhyMP, a Formally Verified Arbitrary-Precision Integer Library. Journal of Symbolic Computation, 2023, 115, pp.74-95. ⟨10.1016/j.jsc.2022.07.007⟩. ⟨hal-03233220⟩
118 View
180 Download

Altmetric

Share

Gmail Facebook X LinkedIn More