Predicate learning and selective theory deduction for a difference logic solver

Proceedings - Design Automation Conference

Volumn , Issue , 2006, Pages 235-240

  Wang, Chao ^a   Gupta, Aarti ^a   Ganai, Malay ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

Decision procedure; Difference logic; SAT; SMT solver

Indexed keywords

ABSTRACTING; BOOLEAN FUNCTIONS; DECISION THEORY; GRAPH THEORY; PROBLEM SOLVING;

BOOLEAN COMBINATION; DIFFERENCE LOGIC; DIFFERENCE LOGIC SOLVER; PREDICATE LEARNING; REGISTER-TRANSFER; SELECTIVE THEORY DEDUCTION; TRANSITIVITY CONSTRAINTS;

LOGIC CIRCUITS;

EID: 34547212526     PISSN: 0738100X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146909.1146971     Document Type: Conference Paper

References (26)

1. A. Armando, C. Castellini, E. Giunchiglia, and M. Maratea. A SAT-based decision procedure for the boolean combination of difference constraints. In Theory and Applications of Satisfiability Testing (SAT'04), pages 166-173, Vancouver, CA, May 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, UT, June 2001.
3. C. Barrett, D. L. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In Formal Methods in Computer Aided Design. Springer, Nov. 1996. LNCS 1166.
4. R. Bryant, S. Lahiri, and S. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In Computer-Aided Verification (CAV'02). Springer, July 2002. LNCS 2404.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.
6. S. Cotton. Satisfiability checking with difference constraints. Msc thesis, IMPRS Computer Science, Saarbrucken, 2005.
7. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
8. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: integrated canonizer and solver. In Computer Aided Verification (CAV'01), pages 246-249. Springer, 2001. LNCS 2102.
9. M. K. Ganai, M. Talupur, and A. Gupta. SDSAT: Tight integration of small domain encoding and lazy approaches in a separation logic solver. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'06), pages 135-150. Springer, 2006. LNCS 3920.
10. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In Computer-Aided Verification (CAV'04), pages 175-188. Springer, July 2004. LNCS 3114.
11. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Symposium on Principles of programming languages (POPL'02), pages 58-70, 2002.
12. T. A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic model checking for real-time systems. In IEEE International Symposium on Logic in Computer Science, pages 394-406, 1992.
13. H. Jain, F. Ivančić, A. Gupta, and M. Ganai. Localization and register sharing for predicate abstraction. In Tools and Algorithms for the Construction and Abnalysis of Systems (TACAS'05), pages 394-409. Springer, 2005. LNCS 3440.
14. S. Lahiri and S. Seshia. The UCLID decision procedure. In Computer Aided Verification (CAV'04), pages 475-478. Springer, 2004. LNCS 3114.
15. Y. Lu, A. Koelbl, and A. Mathur. Formal equivalence checking between system-level models and RTL. In International Conference on Computer-Aided Design (ICCAD'05), 2005. Embedded tutorial.
16. M.Bozzano, R.Bruttomesso, A.Cimatti, T.Junttila, P.v.Rossum, S.Schulz, and R.Sebastiani. An incremental and layered procedure for the satisfiability of linear arithmetic logic. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS'05), pages 317-333. Springer, 2005. LNCS 3440.
17. 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.
18. R. Nieuwenhuis and A. Oliveras. DPLL(T) with exhaustive theory propagation and its application to difference logic. In Computer Aided Verification (CAV'05), pages 321-334. Springer, 2005. LNCS 3576.
19. G. Parthasarathy, M. K. Iyer, K.-T. Cheng, and F. Brewer. Structural search for rtl with predicate learning. In Proceedings of the Design Automation Conference (DAC'05), pages 451-456, Anaheim, CA, June 2005.
20. A. Pnueli, Y. Rodeh, O. Shtrichman, and M. Siegel. The small model property: How small can it be? Information and Computation, 178(1):275-293, Oct. 2002.
21. G. Ramalingam, J. Song, L. Joscovicz, and R. Miller. Solving difference constraints incrementally. Algorithmica, 23(3):261-275, 1999.
22. S. A. Seshia, S. K. Lahiri, and R. E. Bryant. A hybrid SAT-based decision procedure for separation logic with uninterpreted functions. In Proceedings of the Design Automation Conference, pages 425-430, Anaheim, CA, June 2003.
23. J. P. M. Silva and K. A. Sakallah. Grasp - a new search algorithm for satisfiability. In International Conference on Computer-Aided Design, pages 220-227, San Jose, CA, Nov. 1996.
24. O. Strichman, S. A. Seshia, and R. E. Bryant. Deciding separation formulas with SAT. In Computer-Aided Verification (CAV'02), pages 209-222. Springer, July 2002. LNCS 2404.
25. M. Talupur, N. Sinha, O. Strichman, and A. Pnueli. Range allocation for separation logic. In Computer-Aided Verification (CAV'04), pages 148-161. Springer, July 2004. LNCS 3114.
26. C. Wang, F. Ivančić, 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'05), pages 322-336. Springer, 2005. LNCS 3835.