A scalable method for solving satisfiability of integer linear arithmetic logic

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 241-256

  Sheini, Hossein M ^a   Sakallah, Karem A ^a  

^a Department of Ecology and Evolutionary Biology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER SOFTWARE; INTEGER PROGRAMMING; POLYNOMIALS;

BOOLEAN VARIABLES; LINEAR CONSTRAINTS; SOFTWARE VERIFICATION BENCHMARKS; UNIT-TWO-VARIABLE-PER-INEQUALITY (UTVPI);

PROBLEM SOLVING;

EID: 26444611230     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_18     Document Type: Conference Paper

References (33)

1. W. Ackermann, "Solvable Cases of the Decision Problem," North-Holland, Amsterdam, 1954.
2. T. Amon, G. Borriello, T. Hu, and J. Liu, "Symbolic Timing Verification of Timing Diagrams Using Presburger Formulas," DAC, pp 226-231, 1997.
3. ARIO SMT Solver, http://www.eecs.umich.edu/~ario
4. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowics, and R. Sebastiani, "A SAT-Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions," CADE, pp. 193-208, 2002.
5. C. Barrett, D. Dill, and J. Levitt, "Validity Checking for Combinations of Theories with Equality," FMCAD, LNCS 1166, pp. 187-201, 1996
6. M. Bozzano, R. Bruttomesso, A. Cimatti, T.A. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani, "An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic," TACAS, pp 317-333, 2005.
7. R. Brinkmann and R. Drechsler, "RTL-datapath Verification Using Integer Linear Programming," VLSI Design, pp 741-746, 2002
8. J. A. Brzozowski and C.J.H. Seger, "Asynchronous Circuits," Springer, 1994.
9. V. Chvátal, "Edmonds polytopes and a hierarchy of combinatorial problems," Discrete Math. vol. 4 pp. 305-337, 1973.
10. Dash Inc., XPRESS-MP 15.25.03, http://www.dashoptimization.com.
11. D.L. Detlefs, G. Nelson, and J.B. Saxe, "Simplify: A Theorem Prover for Program Checking," Tech Report HPL-2003-148, HP Labs, 2003.
12. N. Eén and N. Sörensson, "An Extensible SAT-solver," SAT, pp. 502-508, 2003.
13. J.C. Filliatre, S. Owre, H. Rueß and N. Shankar, "ICS: Integrated Canonizer and Solver," CAV, pp. 246-249, 2001.
14. V. Ganapathy, S.A. Seshia, S. Jha, T.W. Reps, R.E. Bryant, "Automatic Discovery of API-Level Exploits," ICSE, 2005
15. V. Ganesh, S. Berezin, and D.L. Dill, "Deciding Presburger Arithmetic by Model Checking and Comparisons with Other Methods," FMCAD, pp. 171-186, 2002.
16. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli, "DPLL(T): Fast Decision Procedures," CAV, pp. 175-188, 2004.
17. ILOG CPLEX, http://www.ilog.com/products/cplex.
18. M.K. Iyer, G. Parthasarathy and K.-T. Cheng, "Efficient Conflict-Based Learning in an RTL Circuit Constraint Solver," DATE, pp 666-671, 2005.
19. J. Jaffar, M. Maher, P. Suckey, and R. Yap, "Beyond Finite Domains," Workshop on Principles and Practice of Constraint Programming, 1994.
20. D. Kroening, J. Ouaknine, S. Seshia, and O. Strichman, "Abstraction-based Satisfiability Solving of Presburger Arithmetic," CAV, pp.308-320, 2004
21. J. P. Marques-Silva and K. A. Sakallah, "GRASP: A Search Algorithm for Propositional Satisfiability," IEEE Trans. on Computers, vol. 48(5), pp. 506-521, 1999.
22. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," DAC, pp. 530-535, 2001.
23. L. de Moura and H. Rueß, "An Experimental Evaluation of Ground Decision Procedures," CAV pp. 162-174, 2004.
24. G. Nelson, and D.C. Oppen, "Simplification by Cooperating Decision Procedures," ACM Trans. on Programming Languages and Systems vol. 1, pp 245-257, 1979.
25. M. Presburger, "Uber die Vollstandigkeit eines Gewissen Systems der Arithmetik Ganzer Zahlen, in Welchem die Addition als Einzige Operation Hervortritt," Comptes-rendus du premier congres des mathematiciens des pays slaves, 395: pp 92-101, 1929.
26. W. Pugh, "The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis," ACM conf. on Supercomputing, pp. 4-13, 1991.
27. H. Rueß, and N. Shankar, "Solving Linear Arithmetic Constraints," SRI International Tech Report CSL-SRI-04-01, January 2004.
28. S. Seshia and R. Bryant, "Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds," LICS, pp. 100-109, 2004.
29. R. Shostak, "Deciding Combination of Theories," Journal of the ACM vol. 31 pp. 1-12, 1984.
30. R. Shostak, "Deciding Linear Inequalities by Computing Loop Residues," Journal of the ACM, vol. 28(4) pp. 769-779, 1981.
31. O. Strichman, S.A. Seshia, and R.E. Bryant " Deciding Separation Formulas with SAT", CAV, pp 209-222, 2002.
32. D. Wagner, J. S. Foster, E. A. Brewer, and A. Aiken, "A First Step Towards Detection of Buffer Overrun Vulnerabilities," Network and Distributed System Security Symposium, Internet Society, 2000.
33. J.M. Wilson, "Compact Normal Forms in Prepositional Logic and Integer Programming Formulations," Computers and Operation Research, pp. 309-314, 1990.