Computer arithmetic and formal proofs : verifying floating-point algorithms with the Coq system / [electronic resource]
by Boldo, Sylvie [author.]; Melquiond, Guillaume [author.].
Material type:
BookPublisher: London : ISTE Press ; 2017.Description: 1 online resource.ISBN: 9780081011706; 0081011709.Subject(s): Coq (Electronic resource) | Computer arithmetic | Floating-point arithmetic | Computer algorithms | COMPUTERS -- Computer Literacy | COMPUTERS -- Computer Science | COMPUTERS -- Data Processing | COMPUTERS -- Hardware -- General | COMPUTERS -- Information Technology | COMPUTERS -- Machine Theory | COMPUTERS -- Reference | MATHEMATICS -- Discrete Mathematics | Computer algorithms | Computer arithmetic | Floating-point arithmetic | Electronic booksOnline resources: ScienceDirect | ScienceDirect Summary: 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. Describes the notions of specification and weakest precondition computation and their practical useShows how to tackle algorithms that extend beyond the realm of simple floating-point arithmeticIncludes real analysis and a case study about numerical analysis.
Includes bibliographical references and index.
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. Describes the notions of specification and weakest precondition computation and their practical useShows how to tackle algorithms that extend beyond the realm of simple floating-point arithmeticIncludes real analysis and a case study about numerical analysis.
Vendor-supplied metadata.
There are no comments for this item.