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.
"synopsis" may belong to another edition of this title.
Sylvie Boldo is a Research Director at INRIA in Orsay, France.
Guillaume Melquiond is a Researcher at INRIA in Orsay, France.
"About this title" may belong to another edition of this title.
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand. Seller Inventory # 0de76121c72c0a74f1a93072454a3997
Quantity: Over 20 available
Seller: Majestic Books, Hounslow, United Kingdom
Condition: New. pp. 353. Seller Inventory # 371980152
Quantity: 3 available
Seller: Books Puddle, New York, NY, U.S.A.
Condition: New. pp. 353. Seller Inventory # 26375146663
Quantity: 3 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 306 pages. 9.00x6.00x1.00 inches. In Stock. Seller Inventory # __1785481126
Quantity: 2 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 use Shows how to tackle algorithms that extend beyond the realm of simple floating-point arithmetic Includes real analysis and a case study about numerical analysis 326 pp. Englisch. Seller Inventory # 9781785481123
Quantity: 2 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. New copy - Usually dispatched within 4 working days. 709. Seller Inventory # B9781785481123
Quantity: Over 20 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 use Shows how to tackle algorithms that extend beyond the realm of simple floating-point arithmetic Includes real analysis and a case study about numerical analysis. Seller Inventory # 9781785481123
Quantity: 2 available
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. pp. 353. Seller Inventory # 18375146669
Quantity: 3 available