Formal Verification of Exact Computations Using Newton’s Method
From MaRDI portal
Publication:3183542
DOI10.1007/978-3-642-03359-9_28zbMath1252.68258OpenAlexW1503708287MaRDI QIDQ3183542
Publication date: 20 October 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00369511/file/main.pdf
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Formalization of real analysis: a survey of proof assistants and libraries ⋮ Computer Certified Efficient Exact Reals in Coq ⋮ Formal proofs for theoretical properties of Newton's method
Uses Software
Cites Work
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- A proof of GMP square root
- Formal verification of square root algorithms
- Modern Computer Arithmetic
- Coinductive Formal Reasoning in Exact Real Arithmetic
- Real Number Calculations and Theorem Proving
- Certified Exact Transcendental Real Number Computation in Coq
- Mathematical Knowledge Management
- Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base
- Nonstandard analysis in ACL2
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Formal Verification of Exact Computations Using Newton’s Method
