A Why3 Framework for Reflection Proofs and its Application to GMP's Algorithms

Guillaume Melquiond 1, 2 Raphaël Rieu-Helft 2, 3
2 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 : Earlier work showed that automatic verification of GMP's algorithms using Why3 exceeds the current capabilities of automatic solvers. To complete this verification, numerous cut indications had to be supplied by the user, slowing the project to a crawl. This paper shows how we have extended Why3 with a framework for proofs by reflection, with minimal impact on the trusted computing base. This framework makes it easy to write dedicated decision procedures that make full use of Why3's imperative features and are formally verified. We evaluate how much work could have been saved when verifying GMP's algorithms, had this framework been available. This approach opens the way to efficiently tackling the further verification of GMP's algorithms.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

Contributor : Raphaël Rieu-Helft <>
Submitted on : Thursday, April 12, 2018 - 4:41:54 PM
Last modification on : Tuesday, July 17, 2018 - 12:11:06 PM


Files produced by the author(s)



Guillaume Melquiond, Raphaël Rieu-Helft. A Why3 Framework for Reflection Proofs and its Application to GMP's Algorithms. 9th International Joint Conference on Automated Reasoning, Jul 2018, Oxford, United Kingdom. pp.178-193, ⟨10.1007/978-3-319-94205-6_13⟩. ⟨hal-01699754v2⟩



Record views


Files downloads