Yasser Shoukry
George J. Pappas
ABSTRACT
We address the problem of determining the satisfiability of a Boolean combination of convex constraints over the real numbers, which is common in the context of hybrid system verification and control. We first show that a special type of logic formulas, termed monotone Satisfiability Modulo Convex (SMC) formulas, is the most general class of formulas over Boolean and nonlinear real predicates that reduce to convex programs for any satisfying assignment of the Boolean variables. For this class of formulas, we develop a new satisfiability modulo convex optimization procedure that uses a lazy combination of SAT solving and convex programming to provide a satisfying assignment or determine that the formula is unsatisfiable. Our approach can then leverage the efficiency and the formal guarantees of state-of-the-art algorithms in both the Boolean and convex analysis domains. A key step in lazy satisfiability solving is the generation of succinct infeasibility proofs that can support conflict-driven learning and decrease the number of iterations between the SAT and the theory solver. For this purpose, we propose a suite of algorithms that can trade complexity with the minimality of the generated infeasibility certificates. Remarkably, we show that a minimal infeasibility certificate can be generated by simply solving one convex program for a sub-class of SMC formulas, namely ordered positive unate SMC formulas, that have additional monotonicity properties. Perhaps surprisingly, ordered positive unate formulas appear themselves very frequently in a variety of practical applications. By exploiting the properties of monotone SMC formulas, we can then build and demonstrate effective and scalable decision procedures for problems in hybrid system verification and control, including secure state estimation and robotic motion planning.
- J. N. Hooker, "Logic, optimization, and constraint programming," INFORMS Journal on Computing, vol. 14, no. 4, pp. 295--321, 2002. Google Scholar
Digital Library
- C. Barrett, R. Sebastiani, S. A. Seshia, and C. Tinelli, Satisfiability Modulo Theories, Chapter in Handbook of Satisfiability. IOS Press, 2009.Google Scholar
- S. Ratschan, "Efficient solving of quantified inequality constraints over the real numbers," ACM Trans. Comput. Logic, vol. 7, no. 4, pp. 723--748, 2006. Google ScholarDigital Library
- S. Gao, J. Avigad, and E. M. Clarke, "δ-complete decision procedures for satisfiability over the reals," in Proc. Int. Joint Conf. Automated Reasoning, 2012, pp. 286--300. Google ScholarDigital Library
- S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univesity Press, 2004. Google ScholarCross Ref
- R. Nieuwenhuis, A. Oliveras, and C. Tinelli, "Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)," J. ACM, vol. 53, no. 6, pp. 937--977, Nov. 2006. Google ScholarDigital Library
- A. Cimatti et al., "Satisfiability modulo the theory of costs: Foundations and applications," in Proc. TACAS, 2010, pp. 99--113. Google ScholarDigital Library
- Y. Li et al., "Symbolic optimization with SMT solvers," in ACM SIGPLAN Notices, vol. 49, no. 1, 2014, pp. 607--618. Google ScholarDigital Library
- A. Bauer, M. Pister, and M. Tautschnig, "Tool-support for the analysis of hybrid systems and models," in Proc. of DATE, 2007. Google ScholarCross Ref
- L. De Moura and N. Björner, "Z3: An efficient SMT solver," in Proc. Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems, 2008, pp. 337--340. Google ScholarCross Ref
- M. Franzle et al., "Efficient solving of large non-linear arithmetic constraint systems with complex Boolean structure," in JSAT Special Issue on SAT/CP Integration, 2007.Google Scholar
- S. Gao, S. Kong, and E. M. Clarke, "dReal: An SMT solver for nonlinear theories over the reals," 2013, vol. 7898, pp. 208--214.Google Scholar
- P. Nuzzo et al., "CalCS: SMT solving for non-linear convex constraints," in Proc. Formal Methods in Computer-Aided Design, Oct. 2010, pp. 71--79.Google Scholar
- Y. Shoukry et al., "Sound and complete state estimation for linear dynamical systems under sensor attack using satisfiability modulo theory solving," in Proc. American Control Conference, 2015, pp. 3818--3823. Google ScholarCross Ref
- Y. Shoukry et al., "Scalable lazy SMT-based motion planning," in Proc. Int. Conf. Decision and Control, 2016, pp. 6683--6688. Google ScholarCross Ref
- E. Plaku and S. Karaman, "Motion planning with temporal-logic specifications: Progress and challenges," AI Communications, no. Preprint, pp. 1--12. Google ScholarCross Ref
- A. Pnueli, "The temporal logic of programs," in FOCS, 1977, pp. 46--57.Google ScholarDigital Library
- M. Grant, S. Boyd, and Y. Ye, "Disciplined convex programming," in Global optimization. Springer, 2006, pp. 155--210.Google Scholar
- Y. Shoukry, P. Nuzzo, A. Sangiovanni-Vincentelli, S. Seshia, G. Pappas, and P. Tabuada, "SMC: Satisfiability modulo convex optimization," ArXiv e-prints, 2017.Google Scholar
- J. W. Chinneck and E. W. Dravnieks, "Locating minimal infeasible constraint sets in linear programs," ORSA Journal on Computing, vol. 3, no. 2, pp. 157--168, 1991. Google ScholarCross Ref
- A. Bemporad and M. Morari, "Control of systems integrating logic, dynamics, and constraints," Automatica, vol. 35, 1999.Google Scholar
- (2012, Feb.) IBM ILOG CPLEX Optimizer. [Online]. Available: www.ibm.com/software/integration/optimization/cplex-optimizer/Google Scholar
- "The international SAT competitions web page." http://www.satcompetition.org/, accessed: 2016--10-01.Google Scholar
Index Terms
- SMC: Satisfiability Modulo Convex Optimization
Recommendations
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)
We first introduce Abstract DPLL, a rule-based formulation of the Davis--Putnam--Logemann--Loveland (DPLL) procedure for propositional satisfiability. This abstract framework allows one to cleanly express practical DPLL algorithms and to formally reason ...
Approximating Quantified SMT-Solving with SAT
SSIRI-C '11: Proceedings of the 2011 Fifth International Conference on Secure Software Integration and Reliability Improvement - CompanionSatisfiability Modulo Theories (SMT) is an extension of SAT towards FOL. SMT solvers have proven highly scalable and efficient for problems based on some ground theorems. However, SMT problems involving quantifiers and combination of theorems is a long-...
Parikh’s Theorem Made Symbolic
Parikh’s Theorem is a fundamental result in automata theory with numerous applications in computer science. These include software verification (e.g. infinite-state verification, string constraints, and theory of arrays), verification of cryptographic ...
Comments