Computer Arithmetic and Formal Proofs: Verifying Floating-point Algorithms with the Coq System

Abstract : Floating-point arithmetic is ubiquitous in modern computing, as it is the tool of choice to approximate real numbers. Due to its limited range and precision, its use can become quite involved and potentially lead to numerous failures. One way to greatly increase confidence in floating-point software is by computer-assisted verification of its correctness proofs. This book provides a comprehensive view of how to formally specify and verify tricky floating-point algorithms with the Coq proof assistant. It describes the Flocq formalization of floating-point arithmetic and some methods to automate theorem proofs. It then presents the specification and verification of various algorithms, from error-free transformations to a numerical scheme for a partial differential equation. The examples cover not only mathematical algorithms but also C programs as well as issues related to compilation.
Complete list of metadatas

https://hal.inria.fr/hal-01632617
Contributor : Guillaume Melquiond <>
Submitted on : Friday, November 10, 2017 - 2:28:19 PM
Last modification on : Thursday, October 3, 2019 - 2:04:03 PM

Identifiers

  • HAL Id : hal-01632617, version 1

Citation

Sylvie Boldo, Guillaume Melquiond. Computer Arithmetic and Formal Proofs: Verifying Floating-point Algorithms with the Coq System. ISTE Press - Elsevier, pp.326, 2017, 9781785481123. ⟨hal-01632617⟩

Share

Metrics

Record views

379