An efficient decision procedure for UTVPI constraints

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

Volumn 3717 LNAI, Issue , 2005, Pages 168-183

  Lahiri, Shuvendu K ^a   Musuvathi, Madanlal ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; INTEGER PROGRAMMING; MATHEMATICAL MODELS;

DECISION PROCEDURES; INTEGER CONSTANTS; TRANSITIVE CLOSURES; UTVPI CONSTRAINTS;

CONSTRAINT THEORY;

EID: 33646203586     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_9     Document Type: Conference Paper

References (20)

1. T. Ball, B. Cook, S. K. Lahiri, and L. Zhang. Zapato: Automatic Theorem Proving for Software Predicate Abstraction Refinement. In Computer Aided Verification (CAV '04), LNCS 3114. Springer-Verlag, 2004.
2. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In Programming Language Design and Implementation (PLDI '01), Snowbird, Utah, June, 2001. SIGPLAN Notices, 36(5), May 2001.
3. R. Bellman. On a routing problem. Quarterly of Applied Mathematics, 16(1):87-90, 1958.
4. B. V. Cherkassky and A. V. Goldberg. Negative-cycle detection algorithms. In European Symposium on Algorithms, pages 349-363, 1996.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
6. C. Flanagan, R. Joshi, X. Ou, and J. Saxe. Theorem Proving usign Lazy Proof Explication. In Computer-Aided Verification (CAV 2003), LNCS 2725, pages 355-367. Springer-Verlag, 2003.
7. C. Flanagan, K. R. M. Leino, M. Lillibridge, G. Nelson, J. B. Saxe, and R. Stata. Extended static checking for Java. In ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'02), pages 234-245, 2002.
8. L. R. Ford, Jr., and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962.
9. W. Harvey and P. J. Stuckey. A unit two variable per inequality integer constraint solver for constraint logic programming. In Proceedings of the 20th Australasian Computer Science Conference (ACSC '97), pages 102-111, 1997.
10. J. L. Hennessy and T. R. Gross. Postpass code optimization of pipeline constraints. ACM Trans. Program. Lang. Syst., 5(3):422-448, 1983.
11. J. Jaffar, M. J. Maher, P. J. Stuckey, and H. C. Yap. Beyond Finite Domains. In Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, PPCP'94.
12. J. C. Lagarias. The computational complexity of simultaneous diophantine approximation problems. SIAM Journal of Computing, 14(1):196-209, 1985.
13. S. K. Lahiri and R. E. Bryant. Deductive verification of advanced out-of-order microprocessors. In Computer-Aided Verification (CAV 2003), LNCS 2725, pages 341-354. Springer-Verlag, 2003.
14. S. K. Lahiri and M. Musuvathi. An efficient nelson-oppen decision procedure for difference constraints over rationals. Technical Report MSR-TR-2005-61, Microsoft Research, 2005.
15. A. Miné. The octagon abstract domain. In AST 2001 in WCRE 2001, IEEE, pages 310-319. IEEE CS Press, October 2001.
16. G. C. Necula and P. Lee. Proof generation in the touchstone theorem prover. In Conference on Automated Deduction, LNCS 1831, pages 25-44, 2000.
17. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (TOPLAS), 2(1):245-257, 1979.
18. V. Pratt. Two easy theories whose combination is hard. Technical report, Massachusetts Institute of Technology, Cambridge, Mass., September 1977.
19. S. A. Seshia and R. E. Bryant. Deciding quantifier-free presburger formulas using parameterized solution bounds. In 19th IEEE Symposium of Logic in Computer Science(LICS '04). IEEE Computer Society, July 2004.
20. R. E. Tarjan. Depth first search and linear graph algorithms. SIAM Journal of Computing, 1(2):146-160, 1972.