Cuts from proofs: A complete and practical technique for solving linear inequalities over integers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5643 LNCS, Issue , 2009, Pages 233-247

  Dillig, Isil ^a   Dillig, Thomas ^a   Aiken, Alex ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUNDS; FEASIBLE REGIONS; INTEGER POINT; LINEAR INEQUALITIES; SOLUTION SPACE;

COMPETITION;

COMPUTER AIDED ANALYSIS;

EID: 70350236911     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_20     Document Type: Conference Paper

References (23)

1. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program, pp. 84-97. ACM Press, New York (1978)
2. Pugh, W.: The omega test: A fast and practical integer programming algorithm for dependence analysis. Communications of the ACM (1992)
3. Brinkmann, R., Drechsler, R.: RTL-datapath verification using integer linear programming. In: VLSI Design, pp. 741-746 (2002)
4. Amon, T., Borriello, G., Hu, T., Liu, J.: Symbolic timing verification of timing diagrams using presburger formulas. In: DAC 1997: Proceedings of the 34th annual conference on Design automation, pp. 226-231. ACM, New York (1997)
5. Dutertre, B., De Moura, L.: The yices SMT solver. Technical report, SRI International (2006)
6. De Moura, L., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
7. Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298-302. Springer, Heidelberg (2007)
8. Bruttomesso, R., Cimatti, A., Franzén, A., Griggio, A., Sebastiani, R.: The mathsat 4 SMT solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 299-303. Springer, Heidelberg (2008)
9. Bofill, M., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E., Rubio, A.: The barcelogic SMT solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 294-298. Springer, Heidelberg (2008)
10. Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)
11. Ganesh, V., Berezin, S., Dill, D.: Deciding presburger arithmetic by model checking and comparisons with other methods. In: Aagaard, M.D., O'Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 171-186. Springer, Heidelberg (2002)
12. Schrijver, A.: Theory of Linear and Integer Programming. J. Wiley & Sons, Chichester (1986)
13. Nemhauser, G.L., Wolsey, L.: Integer and Combinatorial Optimization. John Wiley & Sons, Chichester (1988)
14. Storjohann, A., Labahn, G.: Asymptotically fast computation of hermite normal forms of integer matrices. In: Proc. Int'l. Symp. on Symbolic and Algebraic Computation: ISSAC 1996, pp. 259-266. ACM Press, New York (1996)
15. http://gmplib.org/: Gnu mp bignum library
16. Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1993)
17. Domich, P., Kannan, R., Trotter, J.L.: Hermite normal form computation using modulo determinant arithmetic. Mathematics of Operations Research 12(1), 50-59 (1987)
18. http://www.smtcomp.org: Smt-comp 2008
19. http://www.gnu.org/software/glpk/: Glpk (gnu linear programming kit)
20. http://lpsolve.sourceforge.net/5.5/: lp solve reference guide
21. http://www.ilog.com/products/cplex/: Cplex
22. Jain, H., Clarke, E., Grumberg, O.: Efficient craig interpolation for linear diophantine (dis)equations and linear modular equations. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 254-267. Springer, Heidelberg (2008)
23. Golub, G.H., Van Loan, C.F.: Matrix Computations. JHU Press (1996)