Freshly Printed - allow 10 days lead
Couldn't load pickup availability
Computer Arithmetic and Formal Proofs
Verifying Floating-point Algorithms with the Coq System
Provides a comprehensive method on how to formally specify and verify floating-point algorithms with the Coq system for more precise computing
Sylvie Boldo (Author), Guillaume Melquiond (Author)
9781785481123, Elsevier Science
Hardback, published 16 November 2017
326 pages
22.9 x 15.1 x 2.4 cm, 0.65 kg
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.
1. Floating-Point Arithmetic2. The Coq System3. Formalization of Formats and Basic Operators4. Automated Methods5. Error-Free Computations and Applications6. Example Proofs of Advanced Operators7. Compilation of FP Programs8. Deductive Program Verification9. Real and Numerical Analysis
Subject Areas: Computer science [UY], Applied mathematics [PBW], Discrete mathematics [PBD]
