Incremental compilation-to-SAT procedures

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 46-58

  Benedetti, Marco ^a   Bernardini, Sara ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED SOFTWARE ENGINEERING; IMAGE CODING; MATHEMATICAL MODELS; PROBLEM SOLVING;

BMC TOOL (NUSMV); CTS APPROACH; INCREMENTAL COMPILATION-TO-SAT PROCEDURES (ICTS); SAT SOLVER (SIM);

DECISION THEORY;

EID: 26444508884     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_4     Document Type: Conference Paper

References (24)

1. P. A. Abdulla, P. Bjesse, and N. Eén. Symbolic Reachability Analysis Based on SAT-Solvers. In Proc. of TACAS 2000, volume 1785, pages 411-425, 2000.
2. M. Benedetti and S. Bernardini. Incremental Compilation-to-SAT Procedures. Technical Report T03-12-13, sra.itc.it/people/benedetti/TR031213. pdf, Istituto per la Ricerca Scientifica e Tecnologica, 2003.
3. M. Benedetti and A. Cimatti. Bounded Model Checking for Past LTL. In Proc. of TACAS 2003, number 2619 in LNCS, pages 18-33, 2003.
4. H. Bennaceur, I. Gouachi, and G. Plateau. An Incremental Branch-and-Bound Method for Satisfiability Problem. INFORMS Journal on Computing, 10:301-308, 1998.
5. S. Bernardini. Structure and Satisfiability in Prepositional Formulae. AI*IA Notizie, 4, 2003.
6. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic Model Checking without BDDs. In Proc. of Design Automation Conference, volume 1579, pages 193-207, 1999.
7. A. Cimatti, E. M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In Proc. of CAV 2002, volume 2404 of LNCS, 2002.
8. J. M. Crawford and A. D.Baker. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proc. of 12th MAI '94, pages 1092-1097, 1994.
9. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5:394-397, 1962.
10. T. Boy de la Tour. Minimizing the Number of Clauses by Renaming. In Proc. of the 10th Conference on Automated Deduction, pages 558-572, 1990.
11. N. Eén and N. Sörensson. Temporal Induction by Incremental SAT Solving. In Proc. of the First International Workshop on Bounded Model Checking, 2003.
12. Z. Fu. zChaff. http://ee.princeton.edu/~chaff/zchaff.php, 2003.
13. E. Giunchiglia, M. Maratea, A. Tacchella, and D. Zambonin. Evaluating Search Heuristics and Optimization Techniques in Prepositional Satisfiability. In Proc. of IJCAR 2001, 2001.
14. J.N. Hooker. Solving the Incremental Satisfiability Problem. Journal of Logic Programming, 15:177-186, 1993.
15. H. Kautz and B. Selman. Planning as satisfiability. In Proc. of ECAI 1992, pages 359-363.
16. J. Kim, J. Whittemore, J. P. M. Silva, and K. A. Sakallah. On Applying Incremental Satisfiability to Delay Fault Problem. In Proc. of DATE 2000, pages 380-384, 2000.
17. J. Kim, J. Whittemore, J. P. M. Silva, and K. A. Sakallah. On Solving Stack-Based Incremental Satisfiability Problems. In Proc. of the ICCD 2000, pages 379-382, 2000.
18. T. Larrabee. Test pattern generation using boolean satisfiability. In IEEE Transaction on Computer-aided Design, pages 4-15, 1992.
19. F. Massacci and L. Marraro. Logical Cryptanalysis as a SAT Problem. Journal of Automated Reasoning, 24, 2000.
20. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. of the 38th DAC, pages 530-535, 2001.
21. D. A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation. Journal of Symbolic Computation, 2:293-304, 1986.
22. O. Shtrichman. Tuning SAT checkers for Bounded Model Checking. In Proc. of the 12th International Conference on Computer Aided Verification, Lecture Notes in Computer Science. Springer Verlag, 2000.
23. O. Shtrichman. Pruning Techniques for the SAT-based Bounded Model Checking Problem. In Proc. of CHARME'01, pages 58-70, 2001.
24. J. Whittemore, J. Kim, and K. A. Sakallah. SATIRE: A New Incremental Satisfiability Engine. In Proc. of the 38th Conference on Design Automation, pages 542-545, 2001.