Proving bounds on real-valued functions with computations

Abstract : Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as the large amount of numerical computations they require keeps them out of reach from deductive proof processes. However, evaluating programs inside proofs is an efficient way for reducing the size of proof terms while performing numerous computations. This work shows how programs combining automatic differentiation with floating-point and interval arithmetic can provide some efficient yet guaranteed solvers within the Coq proof system.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00180138
Contributor : Guillaume Melquiond <>
Submitted on : Wednesday, October 17, 2007 - 5:39:03 PM
Last modification on : Tuesday, June 22, 2010 - 11:10:53 AM
Long-term archiving on: Monday, September 24, 2012 - 1:37:49 PM

File

article.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Guillaume Melquiond. Proving bounds on real-valued functions with computations. International Joint Conference on Automated Reasoning, IJCAR 2008, Aug 2008, Sydney, Australia. pp.2--17, ⟨10.1007/978-3-540-71070-7_2⟩. ⟨hal-00180138⟩

Share

Metrics

Record views

476

Files downloads

241