Date of Original Version
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-31365-3_23
Abstract or Description
We introduce the notion of “δ-complete decision procedures” for solving SMT problems over the real numbers, with the aim of handling a wide range of nonlinear functions including transcendental functions and solutions of Lipschitz-continuous ODEs. Given an SMT problemϕ and a positive rational number δ, a δ-complete decision procedure determines either that ϕ is unsatisfiable, or that the “δ-weakening” of ϕ is satisfiable. Here, the δ-weakening of ϕ is a variant of ϕ that allows δ-bounded numerical perturbations on ϕ. We establish the existence and complexity of δ-complete decision procedures for bounded SMT over reals with functions mentioned above. We propose to use δ-completeness as an ideal requirement for numerically-driven decision procedures. As a concrete example, we formally analyze the DPLL〈ICP〉 framework, which integrates Interval Constraint Propagation in DPLL(T), and establish necessary and sufficient conditions for its δ-completeness. We discuss practical applications of δ-complete decision procedures for correctness-critical applications including formal verification and theorem proving.
Lecture Notes in Computer Science, 7364, 286-300.