Proving Bounds on Real-Valued Functions with Computations

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 be used as efficient yet certified solvers. They have been implemented in a library for the Coq proof system. This library provides tactics for proving inequalities on real-valued expressions.

• Type: Conference
• Year: 2008
• Where: CADE
• Authors: Guillaume Melquiond
• Keywords: Automated Reasoning, CADE 2008, Coq Proof System, Deductive Proof Processes, Library Provides Tactics