Finite instantiations for integer difference logic

Proceedings of Formal Methods in Computer Aided Design, FMCAD 2006

Volumn , Issue , 2006, Pages 31-38

  Kim, Hyondeuk ^a   Somenzi, Fabio ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTING BOUNDS; INTEGER DIFFERENCE LOGIC; PROPOSITIONAL ABSTRACTION;

DIGITAL ARITHMETIC; INTEGER PROGRAMMING; LOGIC PROGRAMMING; PROBLEM SOLVING;

FORMAL LOGIC;

EID: 34547422426     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2006.13     Document Type: Conference Paper

References (25)

1. T. Ball, R. Majumdar, T. Millstein, and S. K. Rajamani. Automatic predicate abstraction of C programs. In PLDI 01: Programming Language Design and Implementation, Snowbird, UT, June 2001.
2. C. W. 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, Fourteenth Conference on Computer Aided Verification (CAV'02), pages 236-249. Springer-Verlag, Berlin, July 2002. LNCS 2404.
3. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, S. Ranise, P. van Rossum, and R. Sebastiani. Efficient satisfiability modulo theories via delayed theory combination. In Seventeenth Conference on Computer Aided Verification (CAV'05), pages 335-349. Springer-Verlag, Berlin, July 2005. LNCS 3576.
4. M. Bozzano, R. Bruttomesso, A. Cimatti, T. Junttila, P. van Rossum, S. Schulz, and R. Sebastiani. An incremental and layered procedure for the satisfiability of linear arithmetic logic. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'05), pages 317-333, Edinburgh, UK, Apr. 2005. LNCS 3440.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. An Introduction to Algorithms. McGraw-Hill, New York, 1990.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
7. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association for Computing Machinery, 7(3):201-215, July 1960.
8. L. de Moura and H. Reuß. Lemmas on demand for satisfiability solvers. In Fifth International Symposium on the Theory and Application of Satisfiability Testing (SAT'02), Cincinnati, OH, May 2002.
9. Url: http://www.lsi.upc.edu/oliveras/bclt-main.html. [10] C. Flanagan, R. Joshi, X. Ou, and J. B. Saxe. Theorem proving using lazy proof explication. In W. A. Hunt, Jr. and F. Somenzi, editors, Fifteenth Conference on Computer Aided Verification (CAV'03), pages 355-367. Springer-Verlag, Berlin, July 2003. LNCS 2725.
10. M. K. Ganay, M. Talupur, and A. Gupta. SDSAT: Tight integration of small domain encoding and lazy abstraction in a separation logic solver. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'06), pages 135-150, Vienna, Austria, Mar. 2006. LNCS 3920.
11. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras,and C. Tinelli. DPLL(T): Fast decision procedures. In R. Alur and D. Peled, editors, Sixteenth Conference on Computer Aided Verification (CAV'04), pages 175-188. SpringerVerlag, Berlin, July 2004. LNCS 3114.
12. M. K. lyer, G. Parthasarathy, and K.-T. Cheng. SATORI - a fast sequential SAT engine for circuits. In Proceedings of the International Conference on Computer-Aided Design, pages 320-325, San Jose, CA, Nov. 2003.
13. H. Jin, H. Han, and F. Somenzi. Efficient conflict analysis for finding all satisfying assignments of a Boolean circuit. In International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'05), pages 287-300, Apr. 2005. LNCS 3440.
14. H. Jin and F. Somenzi. Prime clauses for fast enumeration of satisfying assignments to Boolean circuits. In Proceedings of the Design Automation Conference, pages 750-753, Anaheim, CA, June 2005.
15. D. Kroening, J. Ouaknine, S. Seshia, and O. Strichman. Abstraction-based satisfiability solving of Presburger arithmetic. In R. Alur and D. Peled, editors, Sixteenth Conference on Computer Aided Verification (CAV'04), pages 308-320. Springer-Verlag, Berlin, July 2004. LNCS 3114.
16. S. Lahiri and M. Musuvathi. An efficient Nelson-Oppen decision procedure for difference constraints over rationals. In Third International Workshop on Pragmatical Aspects of Decision Procedures in Automated Reasoning (PDPAR'05), pages 2-9, Edinburgh, UK, July 2005. To appear in ENTCS.
17. S. K. Lahiri and S. A. Seshia. The UCLID decision procedure. In R. Alur and D. Peled, editors, Sixteenth Conference on Computer Aided Verification (CAV'04), pages 475-478. Springer-Verlag, Berlin, July 2004. LNCS 3114.
18. Url: http://mathsat.itc.it.
19. M. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference, pages 530-535, Las Vegas, NV, June 2001.
20. R. Nieuwenhuis and A. Oliveras. DPLL(T) with exhaustive theory propagation and its application to difference logic. In Seventeenth Conference on Computer Aided Verification (CAV'05), pages 321-334. Springer-Verlag, Berlin, July 2005. LNCS 3576.
21. A. Pnueli, Y. Rodeh, O. Strichman, and M. Siegel. The small model property: How small can it be? Journal of Information and Computation, 178(l):279-293, Oct. 2002.
22. J. P. M. Silva and K. A. Sakallah. Grasp-a new search algorithm for satisfiability. In Proceedings of the International Conference on Computer-Aided Design, pages 220-227, San Jose, CA, Nov. 1996.
23. Url: http://www.csl.sri.com/users/demoura/smt-comp/.
24. M. Talupur, N. Sinha, O. Strichman, and A. Pnueli. Range allociation for separation logic. In R. Alur and D. Peled, editors, Sixteenth Conference on Computer Aided Verification (CAV'04), pages 148-161. Springer-Verlag, Berlin, July 2004. LNCS 3114.
25. C. Wang, F. Ivancic, M. Ganai, and A. Gupta. Deciding separation logic formulae by SAT and incremental negative cycle elimination. In Logic for Programming Artificial Intelligence and Reasoning (LPAR'2005), Montego Bay, Jamaica, Dec. 2005. [27] Url: http://fm.csl.sri.com/yices.