Deciding quantifier-free Presburger formulas using parameterized solution bounds

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 100-109

  Seshia, Sanjit A ^a   Bryant, Randal E ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CONSTRAINT THEORY; INTEGER PROGRAMMING; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING;

DECISION PROCEDURE; FINITE DOMAIN; NON-SEPARATION CONSTRAINTS; PARAMETERIZED SOLUTION;

PARAMETER ESTIMATION;

EID: 4544294526     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319604     Document Type: Conference Paper

References (38)

1. W. Ackermann. Solvable Cases of the Decision Problem. North-Holland, Amsterdam, 1954.
2. C. Barrett, D. L. Dill, and A. Stump. Checking satisfiability of first-order formulas by incremental translation to SAT. In E. Brinksma and K. G. Larsen, editors, Proc. 14th Intl. Conference on Computer-Aided Verification (CAV'02), LNCS 2404, pages 236-249. Springer-Verlag, July 2002.
3. S. Berezin, V. Ganesh, and D. L. Dill. An online proof-producing decision procedure for mixed-integer linear arithmetic. In Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'03), LNCS 2619, pages 521-536, April 2003.
4. I. Borosh, M. Flahiye, D. Rubin, and L. B. Treybig. A sharp bound for solutions of linear Diophantine equations. Proceedings of the American Mathematical Society, 105(4):844-846, April 1989.
5. I. Borosh, M. Flahive, and L. B. Treybig. Small solutions of linear Diophantine equations. Discrete Mathematics, 58:215-220, 1986.
6. I. Borosh and L. B. Treybig. Bounds on positive integral solutions of linear Diophantine equations. Proceedings of the American Mathematical Society, 55(2):299-304, March 1976.
7. J. Brenner and L. Cummings. The Hadamard maximum determinant problem. American Mathematical Monthly, 79:626-630, June-July 1972.
8. R. Brinkmann and R. Drechsler. RTL-datapath verification using integer linear programming. In Proceedings of the IEEE VLSI Design Conference, pages 741-746, 2002.
9. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In E. Brinksma and K. G. Larsen, editors, Proc. Computer-Aided Verification (CAV'02), LNCS 2404, pages 78-92, July 2002.
10. S. Chaki, E. M. Clarke, A. Groce, S. Jha, and H. Veith. Modular verification of software components in C. In Proc. 25th International Conference on Software Engineering (ICSE), pages 385-395, 2003.
11. L. de Moura, H. Rueß, and M. Sorea. Lazy theorem proving for bounded model checking over infinite domains. In Proc. 18th International Conference on Automated Deduction (CADE), pages 438-455, 2002.
12. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Laboratories Palo Alto, 2003.
13. M. J. Fischer and M. O. Rabin. Super-exponential complexity of Presburger arithmetic. Proceedings of SIAM-AMS, 7:27-41, 1974.
14. V. Ganesh, S. Berezin, and D. L. Dill, Deciding Presburger arithmetic by model checking and comparisons with other methods. In Formal Methods in Computer-Aided Design (FMCAD '02), LNCS 2517, pages 171-186. Springer-Verlag, November 2002.
15. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT solver. In Design Automation and Test in Europe (DATE) 2002, pages 142-149, 2002.
16. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proc. 29th ACM Symposium on Principles of Programming Languages, pages 58-70, 2002.
17. ICS: Integrated Canonizer and Solver. Available at http://www.icansolve. com.
18. R. Kannan and C. L. Monma. On the computational complexity of integer programming problems. In Optimisation and Operations Research, volume 157 of Lecture Notes in Economics and Mathematical Systems, pages 161-172. Springer-Verlag, 1978.
19. D. Kroening, J. Ouaknine, S. A. Seshia, and O. Strichman. Abstraction-based satisfiability solving of Presburger arithmetic. In Proc. 16th International Conference on Computer-Aided Verification (CAV), July 2004. To appear.
20. S. McCamant and M. D. Ernst. Predicting problems caused by component upgrades. In Proceedings of the 11th ACM SIGSOFT Symposium on Foundations of Software Engineering (FSE), pages 287-296, 2003.
21. Moscow ML. Available at http://www.dina.dk/ ~sestoft/mosml.html.
22. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In 38th Design Automation Conference (DAC '01), pages 530-535, June 2001.
23. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
24. C. H. Papadimitriou. On the complexity of integer programming. Journal of the ACM, 28(4):765-768, 1981.
25. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization; Algorithms and Complexity, chapter 13. Prentice-Hall, 1982.
26. A. Pnueli, Y. Rodeh, O. Shtrichman, and M. Siegel. Deciding equality formulas by small-domain instantiations. In N. Halbwachs and D. Peled, editors, Computer-Aided Verification, volume 1633 of Lecture Notes in Computer Science, pages 455-469. Springer-Verlag, July 1999.
27. V. Pratt. Two easy theories whose combination is hard. Technical report, Massachusetts Institute of Technology, 1977. Cambridge, MA.
28. M. Preßburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. Comptes-rendus du Premier Congrès des Mathématiciens des Pays Slaves, 395:92-101, 1929.
29. W. Pugh. The omega test: A fast and practical integer programming algorithm for dependence analysis. In Supercomputing, pages 4-13, 1991.
30. A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, 1998.
31. N. Shankar and H. Rueß. Combining Shostak theories. In S. Tison, editor, Proc. Rewriting Techniques and Applications, LNCS 2378, pages 1-18. Springer-Verlag, July 2002.
32. R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1-12, 1984.
33. The LASH Toolset. Available at http://www.monte-fiore.ulg.ac.be/ ~boigelot/research/lash.
34. The UCLID Verification System. Available at http://www.cs.emu.edu/~uclid.
35. The Wisconsin Safety Analyzer Project. http://www.cs.wisc.edu/wisa.
36. The zChaff Boolean Satisfiability Solver. Available at http://ee.princeton.edu/~chaff/zchaff.php.
37. J. von zur Gathen and M. Sieveking. A bound on solutions of linear integer equalities and inequalities. Proceedings of the American Mathematical Society, 72(1):155-158, October 1978.
38. P. Wolper and B. Boigelot. An automata-theoretic approach to Presburger arithmetic constraints. In Proc. Static Analysis Symposium, LNCS 983, pages 21-32, September 1995.