How to Get an Efficient yet Verified Arbitrary-Precision Integer Library

Raphaël Rieu-Helft 1, 2, 3 Claude Marché 2, 3 Guillaume Melquiond 2, 3
3 TOCCATA - Certified Programs, Certified Tools, Certified Floating-Point Computations
LRI - Laboratoire de Recherche en Informatique, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, CNRS - Centre National de la Recherche Scientifique : UMR8623
Abstract : The GNU Multi-Precision library is a widely used, safety-critical, library for arbitrary-precision arithmetic. Its source code is written in C and assembly, and includes intricate state-of-the-art algorithms for the sake of high performance. Formally verifying the functional behavior of such highly optimized code, not designed with verification in mind, is challenging. We present a fully verified library designed using the Why3 program verifier. The use of a dedicated memory model makes it possible to have the Why3 code be very similar to the original GMP code. This library is extracted to C and is compatible and performance-competitive with GMP.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download
Contributor : Guillaume Melquiond <>
Submitted on : Thursday, August 31, 2017 - 9:40:30 AM
Last modification on : Tuesday, April 24, 2018 - 5:20:13 PM
Long-term archiving on : Friday, December 1, 2017 - 5:56:08 PM


Files produced by the author(s)



Raphaël Rieu-Helft, Claude Marché, Guillaume Melquiond. How to Get an Efficient yet Verified Arbitrary-Precision Integer Library. 9th Working Conference on Verified Software: Theories, Tools, and Experiments, Jul 2017, Heidelberg, Germany. pp.84-101, ⟨10.1007/978-3-319-72308-2_6⟩. ⟨hal-01519732v2⟩



Record views


Files downloads