CalCS: SMT solving for non-linear convex constraints

Formal Methods in Computer Aided Design, FMCAD 2010

Volumn , Issue , 2010, Pages 71-79

  Nuzzo, Pierluigi ^a   Puggelli, Alberto ^a   Seshia, Sanjit A ^a   Sangiovanni Vincentelli, Alberto ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC CONSTRAINTS; BOOLEAN COMBINATIONS; BOOLEAN REASONING; BOUNDED MODEL CHECKING; CONVEX CONSTRAINTS; CONVEX PROGRAMMING; CONVEX SET; DUALITY THEORY; FORMAL VERIFICATIONS; GEOMETRIC PROPERTIES; HYBRID AUTOMATONS; NON-CONVEX CONSTRAINTS; NON-LINEAR; NON-LINEAR CONSTRAINTS; REAL NUMBER; SATISFIABILITY MODULO THEORIES; SATISFIABILITY SOLVING; THEORY SOLVERS;

COMPUTER AIDED DESIGN; MODEL CHECKING; SET THEORY; STATIC ANALYSIS;

FORMAL METHODS;

EID: 79958711784     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. D. Walter, S. Little, and C. Myers, "Bounded model checking of analog and mixed-signal circuits using an SMT solver," in Automated Technology for Verification and Analysis, 2007, pp. 66-81.
2. C. Tomlin, I. Mitchell, and R. Ghosh, "Safety verification of conflict resolution maneuvers," IEEE Trans. Intell. Transp. Syst., vol. 2, no. 2, pp. 110-120, Jun. 2001. (Pubitemid 33675781)
3. M. Franzle and C. Herde, "HySAT: An efficient proof engine for bounded model checking of hybrid systems," Formal Methods in System Design, pp. 179-198, 2007. (Pubitemid 46589220)
4. S. Jha, B. Brady, and S. A. Seshia, "Symbolic reachability analysis of lazy linear hybrid automata," in 5th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), October 2007, pp. 241-256.
5. C. Barrett, R. Sebastiani, S. A. Seshia, and C. Tinelli, Satisfiability Modulo Theories, Chapter in Handbook of Satisfiability. IOS Press, 2009.
6. S. Ratschan, "Efficient solving of quantified inequality constraints over the real numbers," ACM Trans. Comput. Logic, vol. 7, no. 4, pp. 723-748, 2006. (Pubitemid 44600808)
7. R. Nieuwenhuis, A. Oliveras, and C. Tinelli, "Solving SAT and SAT Modulo Theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T)," Journal of the ACM, vol. 53, no. 6, pp. 937-977, 2006. (Pubitemid 46276962)
8. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univesity Press, 2004.
9. M. Franzle, C. Herde, S. Ratschan, T. Schubert, and T. Teige, "Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure," in JSAT Special Issue on SAT/CP Integration, 2007, pp. 209-236.
10. A. Bauer, M. Pister, and M. Tautschnig, "Tool-support for the analysis of hybrid systems and models," in Proc. of DATE, 2007.
11. "IPOPT," https://projects.coin-or.org/Ipopt.
12. M. Ganai and F. Ivancic, "Efficient decision procedure for non-linear arithmetic constraints using CORDIC," in Formal Methods in Computer-Aided Design, 2009. FMCAD 2009, 15-18 2009, pp. 61-68.
13. J. P. Fishburn and A. E. Dunlop, "TILOS: A posynomial programming approach to transistor sizing," in IEEE International Conference on Computer- Aided Design: ICCAD-85, 15-18 1985, pp. 326-328. (Pubitemid 16559089)
14. S. S. Sapatnekar, V. B. Rao, P. M. Vaidya, and S.-M. Kang, "An exact solution to the transistor sizing problem for CMOS circuits using convex optimization," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 12, no. 11, pp. 1621-1634, 1993.
15. M. del Mar Hershenson, S. P. Boyd, and T. H. Lee, "Optimal design of a CMOS op-amp via geometric programming," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 20, no. 1, pp. 1-21, 2001. (Pubitemid 32296860)
16. X. Li, P. Gopalakrishnan, Y. Xu, and L. Pileggi, "Robust Analog/RF Design with Projection-Based Posynomial Modeling," in Proc. IEEE/ACM International Conference on CAD, 2004, pp. 855-862. (Pubitemid 40449329)
17. Y. Xu, K. Hsiung, X. Li, I. Nuasieda, S. Boyd, and L. Pileggi, "OPERA: OPtimization with Ellispoidal uncertainty for Robust Analog IC design," 2005, pp. 632-637.
18. A. Bemporad and N. Giorgetti, "A SAT-based hybrid solver for optimal control of hybrid systems," in Hybrid Systems: Computation and Control, 2004.
19. -, "Logic-based solution methods for optimal control of hybrid systems," IEEE Transactions on Automatic Control, vol. 51, no. 6, pp. 963-976, Jun. 2006. (Pubitemid 43997246)
20. O. L. Mangasarian, "Set containment characterization," J. of Global Optimization, vol. 24, pp. 473-480, 2002.
21. V. Jeyakumar, "Characterizing set containments involving infinite convex constraints and reverse-convex constraints," SIAM J. Optimization, vol. 13, pp. 947-959, 2003. (Pubitemid 37416691)
22. "MiniSAT SAT solver," http://minisat.se.
23. M. Grant and S. Boyd, "CVX: Matlab software for disciplined convex programming, version 1.21," http://cvxr.com/cvx, May 2010.
24. M. Grant, S. Boyd, and Y. Ye, "Disciplined convex programming," in Global Optimization: From Theory to Implementation, 2006, pp. 155-210.
25. "Benchmarks," http://www.eecs.berkeley.edu/~nuzzo/Research. html.
26. "3-sat," http://people.cs.ubc.ca/~hoos/SATLIB/benchm.html.
27. C. Tomlin, G. Pappas, and S. Sastry, "Conflict resolution for air traffic management: A study in multi-agent hybrid systems," IEEE Transactions on Automatic Control, vol. 43, no. 4, pp. 110-120, Apr. 1998.
28. T. Vo, E. Barr, and Z. Su, personal communication.