An efficient sequential SAT solver with improved search strategies

Proceedings -Design, Automation and Test in Europe, DATE '05

Volumn II, Issue , 2005, Pages 1102-1107

  Lu, F ^a   Iyer, M K ^a   Parthasarathy, G ^a   Wang, L C ^a   Cheng, K T ^a   Chen, K C ^b  

^a University of California   (United States)

^b Design Technology Cadence Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SAT SOLVER; SEARCH STRATEGIES; SEQ-SAT; STATE VARIABLES;

CODES (SYMBOLS); DECISION MAKING; DECISION THEORY; HEURISTIC METHODS; OPTIMIZATION; SEARCH ENGINES;

PROBLEM SOLVING;

EID: 33646944389     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2005.55     Document Type: Conference Paper

References (17)

1. M. K. Iyer, G Parthasarathy, K.-T. Cheng, SATORI - A Fast Sequential SAT Engine for Circuits. Proc. IEEE/ACM International Conference on Computer-Aided Design 2003.
2. A. Biere, A. Cimatti. E. M. Clarke, M. Fujita, and Y. Zhu, Symbolic Model Checking using SAT Procedures instead of BDDs. In Proc. of the 36lh ACM/IEEE Design Automation Conf., pp. 317-320, June 1999.
3. P. Tafertshofer, A. Ganz, and K. Antreich, IGRAINE - An Implication-Graph based Engine for Fast Implication, Justification and Propagation. IEEE Trans, on Computer-Aided Design. 19(8):907-927, August 2000.
4. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff: Engineering an efficient SAT solver. Proc. of ACM/IEEE Design Automation Conf., pp. 530-535, June 2001.
5. E. Goldberg and Y. Novikov, BerkMin: A fast and robust Sat_Solver. Proc. European Design and Test Conf., pp. 142-149. March 2002.
6. Feng Eu, Li-C. Wang, Kwang-Ting Cheng, A circuit SAT solver with signal correlation guided learning. In Proc. European Design and Test Conference 2003.
7. P. Tafertshofer, A. Ganz, and M. Henftling, A SAT-Based Implication Engine for Efficient ATPG, Equivalence Checking, and Optimization of Netlists. Proc. IEEE/ACM International Conference on Computer-Aided Design, pp. 648-655, Nov. 1997.
8. st ed., 1990.
9. G Parthasarathy, M. K. Iyer, Li-C. Wang and K.-T. Cheng, Efficient Reachability Checking and Pre-image Computation using Sequential SAT. Proc. Asia and South Pacific Design Automation Conf. 2004.
10. H. Zhang. SATO: An Efficient Prepositional Prover. Proc. of International Conference on Automated Deduction, Vol 1249, LNAI, pp. 272-275. 1997
11. J. P. Marques-Silva and K. A. Sakallah. GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Trans on Computers. vol.48, pp. 506-521, 1999.
12. E. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. Proc. IEEE/ACM International Conference on Computer-Aided Design, pp. 279-285, Nov. 2001.
13. K. E. McMillan. Applying SAT methods in unbounded symbolic model checking. Proc. of International Conference on Computer Aided Verification, Vol 2404. ENSC, pp. 250-264, 2002.
14. H.-J. Kang, I.-C. Park. SAT-Based Unbounded Symbolic Model Checking. Proc. of ACM/IEEE Design Automation Conf., pp. 840-843, June 2003.
15. B. Li, M. S. Hsiao, and S. Sheng. A novel SAT all-solutions solver for efficient preimage computation. Proc. of Design, Automation and Test in Europe Conf., pp. 10272-10277, Feb. 2004.
16. A. Cimatti, E. Clarke, E. Giunchiglia, et. al., NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In Proc. CAV'02, LNCS. Springer Verlag, 2002.
17. M.K.Ganai, L.Zhang, P.Ashar, A.Gupta, and S.Malik. Combining strengths of circuit-based and CNF-based algorithms for a high-performance SAT solver. In Proc. ACM/IEEE Design Automation Conf., pp. 747-750. June 2002.