δ-Complete Decision Procedures for Satisfiability over the Reals

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.

[1]  Bruno Dutertre,et al.  A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

[2]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

[3]  Malay K. Ganai,et al.  Efficient decision procedure for non-linear arithmetic constraints using CORDIC , 2009, 2009 Formal Methods in Computer-Aided Design.

[4]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[5]  César A. Muñoz,et al.  Formalization of Bernstein Polynomials and Applications to Global Optimization , 2013, Journal of Automated Reasoning.

[6]  Edmund M. Clarke,et al.  Delta-Decidability over the Reals , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[7]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[8]  Renate A. Schmidt.  Automated Deduction - CADE-22, 22nd International Conference on Automated Deduction, Montreal, Canada, August 2-7, 2009. Proceedings , 2009, CADE.

[9]  Alexandre Goldsztejn,et al.  Including Ordinary Differential Equations Based Constraints in the Standard CP Framework , 2010, CP.

[10]  Klaus Weihrauch,et al.  A Tutorial on Computable Analysis , 2008 .

[11]  Daniel Kroening,et al.  Decision Procedures - An Algorithmic Point of View , 2008, Texts in Theoretical Computer Science. An EATCS Series.

[12]  A Pettorossi.  Automata theory and formal languages , 2008 .

[13]  Thomas C. Hales,et al.  Introduction to the Flyspeck Project , 2005, Mathematics, Algorithms, Proofs.

[14]  Martin Fränzle,et al.  SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems , 2008, ATVA.

[15]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[16]  Sriram Sankaranarayanan,et al.  Integrating ICP and LRA solvers for deciding nonlinear real arithmetic problems , 2010, Formal Methods in Computer Aided Design.

[17]  Benedikt Löwe,et al.  New Computational Paradigms , 2005 .

[18]  Akitoshi Kawamura,et al.  Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[19]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[20]  Stephan Merz,et al.  Model Checking , 2000 .

[21]  David A. McAllester,et al.  Solving Polynomial Systems Using a Branch and Prune Approach , 1997 .

[22]  James H. Davenport,et al.  The complexity of quantifier elimination and cylindrical algebraic decomposition , 2007, ISSAC '07.

[23]  Lawrence C. Paulson,et al.  MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions , 2010, Journal of Automated Reasoning.

[24]  Mohamed Nassim Seghir,et al.  A Lightweight Approach for Loop Summarization , 2011, ATVA.

[25]  Martin Fränzle,et al.  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure , 2007, J. Satisf. Boolean Model. Comput..

[26]  Jeremy Avigad,et al.  Combining decision procedures for the reals , 2006, Log. Methods Comput. Sci..

[27]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[28]  César Muñoz,et al.  Formalization of an Efficient Representation of Bernstein Polynomials and Applications to Global Optimization , 2011 .

[29]  Nedialko S. Nedialkov,et al.  Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods , 2011, SEFM.

[30]  David Cohen,et al.  Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference, CP 2010, St. Andrews, Scotland, UK, September 6-10, 2010. Proceedings , 2010, CP.

[31]  Ker-I Ko,et al.  On the Computational Complexity of Integral Equations , 1992, Ann. Pure Appl. Log..

[32]  Salvador Lucas,et al.  Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic , 2009, CADE.

[33]  Frédéric Benhamou,et al.  Continuous and Interval Constraints , 2006, Handbook of Constraint Programming.

[34]  Stefan Ratschan,et al.  Quantified Constraints Under Perturbation , 2002, J. Symb. Comput..

[35]  Nedialko S. Nedialkov,et al.  Validated solutions of initial value problems for ordinary differential equations , 1999, Appl. Math. Comput..

[36]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[37]  Kazunori Ueda,et al.  An interval-based SAT modulo ODE solver for model checking nonlinear hybrid systems , 2011, International Journal on Software Tools for Technology Transfer.

[38]  Edmund M. Clarke,et al.  The Image Computation Problem in Hybrid Systems Model Checking , 2007, HSCC.

[39]  Alberto L. Sangiovanni-Vincentelli,et al.  CalCS: SMT solving for non-linear convex constraints , 2010, Formal Methods in Computer Aided Design.