Using an SMT solver and craig interpolation to detect remove redundant linear constraints in of non-convex polyhedra

ACM International Conference Proceeding Series

Volumn , Issue , 2008, Pages 18-26

  Scholl, Christoph ^a   Disch, Stefan ^a   Pigorsch, Florian ^a   Kupferschmid, Stefan ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Craig interpolation; Hybrid system verification; Linear arithmetic; Non convex polyhedra; Satisfiability modulo theories

Indexed keywords

CRAIG INTERPOLATION; HYBRID SYSTEM VERIFICATION; LINEAR ARITHMETIC; NON-CONVEX POLYHEDRA; SATISFIABILITY MODULO THEORIES;

BOOLEAN FUNCTIONS; ELECTRIC GROUNDING; HYBRID COMPUTERS; HYBRID SYSTEMS; INTERPOLATION; MODEL CHECKING;

TECHNICAL PRESENTATIONS;

EID: 67650695135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1512464.1512469     Document Type: Conference Paper

References (22)

1. C. Barrett, M. Deters, A. Oliveras, and A. Stump. Satisfiability Modulo Theories Competition (SMT-COMP) 2008: Rules and Precedures, 2008. http://smtcomp.org/rules08.pdf.
2. B. Becker, C. Dax, J. Eisinger, and F. Klaedtke. LIRA: Handling constraints of linear arithmetics over the integers and the reals. In Proc. of the 19th International Conference on Computer Aided Verification, LNCS, pages 312-315. Springer, 2007.
3. W. Craig. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. Journal on Symbolic Logic, 22(3):269-285, 1957.
4. W. Damm, S. Disch, H. Hungar, S. Jacobs, J. Pang, F. Pigorsch, C. Scholl, U. Waldmann, and B. Wirtz. Exact state set representations in the verification of linear hybrid systems with large discrete state space. 25 In 5th International Symposium on Automated Technology for Verification and Analysis, volume 4762 of LNCS, pages 425-440. Springer, 2007.
5. W. Damm, S. Disch, H. Hungar, J. Pang, F. Pigorsch, C. Scholl, U. Waldmann, and B. Wirtz. Automatic verification of hybrid systems with large discrete state space. In 4th Symposium on Automated Technology for Verification and Analysis, volume 4218 of LNCS, pages 276-291, 2006. (Pubitemid 44850343)
6. D. Detlefs, G. Nelson, and J. Saxe. Simplify: A theorem prover for program checking. Technical Report HPL-2003-2148, HP Systems Research Center, 2003.
7. B. Dutertre and L. de Moura. A fast linear-arithmetic solver for DPLL(T). In 18th Conference on Computer Aided Verification, volume 4144 of LNCS, pages 81-94. Springer, 2006. (Pubitemid 44560868)
8. N. Éen and N. Sörensson. An extensible SAT-solver. In Theory and Applications of Satisfiability Testing, 6th InternationalConference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8,2003 Selected Revised Papers, volume 2919 of LNCS, pages 541-638. Springer, 2003.
9. J. Eisinger and F. Klaedtke. Don't care words with application to the automata-based approach for real addition. In Proc. of the 18th International Conference on Computer Aided Verification, LNCS, pages 67-80. Springer, 2006. (Pubitemid 44560867)
10. M. Fränzle and C. Herde. HySAT: An efficient proof engine for bounded model checking of hybrid systems. Formal Methods in System Design, 30(3):179-198, 2007. (Pubitemid 46589220)
11. G. Frehse. PHAVer: Algorithmic verification of hybrid systems past HyTech. In 8th Workshop on Hybrid Systems: Computation and Control, volume 3414 of LNCS, pages 258-273. Springer, 2005. (Pubitemid 41252072)
12. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech: A model checker for hybrid systems. Software Tools for Technology Transfer, 1(1-2):110-122, 1997.
13. C.-C. Lee, J.-H. R. Jiang, C.-Y. Huang, and A. Mishchenko. Scalable exploration of functional dependency by interpolation and incremental SAT solving. In G. G. E. Gielen, editor, ICCAD, pages 227-233. IEEE, 2007.
14. R. Loos and V. Weispfenning. Applying linear quantifier elimination. The Computer Journal, 36(5):450-462, 1993.
15. K. L. McMillan. Interpolation and SAT-based model checking. In 15th Conference on Computer Aided Verification, volume 2725 of LNCS, pages 1-13. Springer, 2003.
16. A. Mishchenko, S. Chatterjee, R. Jiang, and R. K. Brayton. FRAIGs: A unifying representation for logic synthesis and verification. Technical report, EECS Dept., UC Berkeley, 2005.
17. F. Pigorsch, C. Scholl, and S. Disch. Advanced unbounded model checking by using AIGs, BDD sweeping and quantifier scheduling. In 6th Conference on Formal Methods in Computer Aided Design, pages 89-96. IEEE Press, 2006. (Pubitemid 47159929)
18. P. Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. Journal on Symbolic Logic, 62(3):981-998, 1997.
19. S. Ranise and C. Tinelli. The SMT-LIB Standard: Version 1.2, 2006. http://combination.cs.uiowa.edu/smtlib/papers/format-v1.2-r06.08.30.pdf.
20. A. Stump, C. W. Barrett, and D. L. Dill. CVC: A cooperating validity checker. In Proceedings of the 14th International Conference on Computer Aided Verification, volume 2404 of LNCS, pages 500-504. Springer, 2002.
21. G. Tseitin. On the complexity of derivations in propositional calculus. In A. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logics. 1968.
22. F. Wang. Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures. IEEE Transactions on Software Engineering, 31(1):38-52, 2005.