A signal correlation guided circuit-SAT solver

Journal of Universal Computer Science

Volumn 10, Issue 12, 2004, Pages 1629-1654

  Lu, Feng ^a   Wang, Li C ^a   Cheng, Kwang Ting ^a   Moondanos, John ^b   Hanna, Ziyad ^b  

^a University of California   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

ATPG; Boolean Equivalence Checking; Boolean Satisfiability

Indexed keywords

EID: 23844455175     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (31)

1. [Abramovici et al. 1990] M. Abramovici, M.A. Breuer, and A.D. Friedman, Chapters 3,5, and 6: Logic Simulation, Fault Simulation, Test Generation, Digital Systems Testing and Testable Design, W. H. Freeman, 1990.
2. [Biere et al. 1999] 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 36th ACM/IEEE Design Automation Conf., June 1999, pp. 317-320.
3. [Brglez et al. 1985] F. Brglez, P. Pownall, R. Hum, "Accelerated ATPG and Fault Grading via Testability Analysis," In Proc. of the International Conference on Circuit and Systems, 1985, pp. 695-698.
4. [Brglez et al. 1989] F. Brglez, D. Bryan, K. Kozminski, "Combinational Profiles of Sequential Benchmark Circuits," In Proc. of ISCAS-89, pp. 1929-1924.
5. [Broering et al. 2003] E. Broering, and S.V. Lokam, "Width-Based Algorithms for SAT and CIRCUIT-SAT," In Proc. of Theory and Applications of Satisfiability Testing, May 2003, pp. 162-171.
6. [Bryant 1986] R.E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," In IEEE Transactions on Computers, Vol. C-35, No. 8, 1986, pp. 677-691.
7. [Cabodi et al. 2003] G. Cabodi, S. Nocco, and S. Quer, "Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversais," Design, Automation, and Test in Europe (DATE '03), March 2003, pp. 898-903.
8. [Davis et al. 1962] M. Davis, G. Longeman, and D. Loveland, "A Machine Program for Theorem Proving," Communications of the ACM, vol.5, 1962, pp. 394-397.
9. [Ganai et al. 2002] 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 Conference, June 2002, pp. 747-750.
10. [Goldberg and Novikov 2002] E. Goldberg, Y. Novikov, "BerkMin: A fast and robust Sat_Solver," In Proc. Design, Automation and Test in Europe, March 2002, pp. 142-149.
11. [Gupta et al. 2001] A. Gupta, Z. Yang, and P. Ashar, "Dynamic Detection and Removal of Inactive Clauses in SAT with Application in Image Computation," In Proc. ACM/IEEE Design Automation Conference, June 2001, pp. 536-541.
12. [Kuehlmann and Krohm 1997] A. Kuehlmann and F. Krohm, "Equivalence Checking using Cuts and Heaps," Proceedings Design Automation Conference, 1997, pp. 263-268.
13. [Kuehlmann et al. 2001] A. Kuehlmann, M. Ganai, and V. Paruthi, "Circuit-based Boolean Reasoning," in Proc. ACM/IEEE Design Automation Conference, June 2001, pp. 232-237.
14. [Larrabee 1992] T. Larrabee, "Test Pattern Generation Using Boolean Satisfiability," In IEEE Transactions on Computer-Aided Design, Jan, 1992, pp. 4-15.
15. [Lu et al. 2003] F. Lu, L.C. Wang, K.T. Cheng, R. Huang, "A circuit SAT solver with signal correlation guided learning," In Proc. Design, Automation and Test in Europe 2003, pp. 10892-10897.
16. [Marques-Silva and Sakallah 1999] J.P. Marques-Silva and K.A. Sakallah, "GRASP: A Search Algorithm for Prepositional Satisfiability," IEEE Trans on Computers, vol.48 1999, pp. 506-521.
17. [Moondanos et al. 2001] J. Moondanos, C. Seger, Z. Hanna and D. Kaiss, "CLEVER: Divide and Conquer Combinational Logic Equivalence VERification with False Negative Elimination," Proc. Computer-Aided Verification Conference, 2001, pp. 131-143.
18. [Moskewicz et al. 2001] M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," in Proc. Design Automation Conference 2001, pp. 530-535.
19. [Novikov 2003] Y. Novikov, "Local Search for Boolean Relations on the Basis of Unit Propagation," in Proc. Design, Automation and Test in Europe 2003, pp. 10810-10815.
20. [Ostrowski et al. 2002] R. Ostrowski, E. Grgoire, B. Mazure, and L. Sas, "Recovering and Exploiting Structural Knowledge from CNF Formulas," Principles and Practice of Constraint Programming (CP '02), P. Van Hentenryck, ed., LNCS 2470, Springer-Verlag, September 2002, pp. 185-199.
21. [Reda et al. 2002] S. Reda, R. Drechsler, and A. Orailoglu, "On the Relation Between SAT and BDDs for Equivalence Checking," International Symposium on Quality of Electronic Design (ISQED '02), 2002, pp. 394-399.
22. [Ryan 2004] L. Ryan, the siege satisfiability solver, http://www.cs.sfu.ca/loryan/personal/.
23. [Silva et al. 1999] L. Silva L. Silveira, and J.M. Silva, "Algorithms for Solving Boolean Satisfiability in Combinational Circuits," in Proc. Design, Automation and Test in Europe, 1999, pp. 526-530.
24. [Silva et al. 2003] L. Silva and J.M. Silva, "Solving Satisfiability in Combinational Circuits," in IEEE Design and Test of Computers, July/August, 2003, pp. 16-21.
25. [Tafertshofer et al. 1997] P. Tafertshofer, A. Ganz, and M. Henftling, "A SAT-Based Implication Engine for Efficient ATPG, Equivalence Checking, and Optimization of Netlists," in Proc. International Conference on Computer-Aided Design, 1997, pp. 648-657.
26. [Thiffault et al. 2004] C. Thiffault, F. Bacchus, and T. Walsh, "Solving Non-clausal Formulas with DPLL search," in Tenth International Conference on Principles and Practice of Constraint Programming (CP '04), 2004, pp. 663-678.
27. [Tseitin 1968] G.S. Tseitin, "On the Complexity of Derivation in Prepositional Calculus," in Studies in Constructive Mathematics and Mathematical Logic, Part 2, 1968, pp. 115-125.
28. Reprinted in J. Siekmann, and G. Wrightson, eds., Automation of Reasoning, Vol. 2, Springer-Verlag, 1983, pp. 466-483.
29. [Velev 2000] M.N. Velev, http://www.ece.cmu.edu/~mvelev Benchmark Suites, October 2000.
30. [Zhang et al. 2001] L. Zhang, C. Madigan, M. Moskewicz, and S. Malik, "Efficient conflict driven learning in a Boolean satisfiability solver," in Proc. International Conference on Computer-Aided Design 2001, pp. 279-285.
31. [Zhang 1997] H. Zhang, "SATO: An Efficient Prepositional Prover," Proc. of International Conference on Automated Deduction, Vol 1249, LNAI, 1997, pp. 272-275.