Proving bounds on real-valued functions with computations - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Proving bounds on real-valued functions with computations

(1)
1

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.
Fichier principal
Vignette du fichier
article.pdf (151.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00180138 , version 1 (17-10-2007)

Identifiers

Cite

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⟩

Collections

INRIA
323 View
162 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More