Computer Arithmetic and Formal Proofs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Books Year : 2017

Computer Arithmetic and Formal Proofs


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.
No file

Dates and versions

hal-01632617 , version 1 (10-11-2017)


  • HAL Id : hal-01632617 , version 1


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⟩
560 View
0 Download


Gmail Facebook Twitter LinkedIn More