Integrating observability don't cares in all-solution SAT solvers

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn , Issue , 2006, Pages 1587-1590

  Safarpour, Sean ^a   Veneris, Andreas ^a   Drechsler, Rolf ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; ITERATIVE METHODS; NETWORKS (CIRCUITS); OPTIMIZATION; PROBLEM SOLVING; SCHEMATIC DIAGRAMS;

OBSERVABILITY DON'T CARES (ODC); SAT SOLVER; SOLUTION BOOLEAN SATISFIABILITY (SAT); STRUCTURAL CIRCUIT;

AUTOMATIC TEST PATTERN GENERATION;

EID: 34547276733     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A. Biere, A. Cimatti, E. Clarke, M. Fujita, and Y. Zhu, "Symbolic model checking using SAT procedures instead of BDDs," in Design Automation Conf., 1999, pp. 317-320.
2. S. Sapra, M. Theobald, and E. Clarke, "SAT-based algorithms for logic minimization," in Int'l Conf. on Comp. Design, 2003, pp. 510-518.
3. T. Larrabee, "Test pattern generation using Boolean satisfiability," IEEE Trans. on CAD, vol. 11, pp. 4-15, 1992.
4. K. McMillan, "Applying SAT methods in unbounded symbolic model checking." in Computer Aided Verification, 2002, pp. 250-264.
5. M. Fahim Ali, A. Veneris, S. Safarpour, R. Drechsler, A. Smith, and M.S.Abadir, "Debugging sequential circuits using Boolean satisfiability," in Int'l Conf. on CAD, 2004, pp. 204-209.
6. A. Mishchenko and R. Brayton, "SAT-based complete don't-care computation for network optimization," in Design, Automation and Test in Europe, 2005, pp. 418-423.
7. M. Ganai, A. Gupta, and P. Ashar, "Efficient SAT-based symbolic unbounded model checking using circuit cofactoring," in Int'l Conf. on CAD, Nov. 2004, pp. 510-517.
8. H.-J. Kang and I.-C. Park, "SAT-based unbounded symbolic model checking," IEEE Trans. on CAD, vol. 24, no. 2, pp. 129-140, 2005.
9. A. Gupta, A. Gupta, Z. Yang, and P. Ashar, "Dynamic detection and removal of inactive clauses in SAT with application in image computation," in Design Automation Conf., 2001, pp. 536-541.
10. S. Safarpour, A. Veneris, R. Drechsler, and J. Hang, "Managing don't cares in Boolean satisfiability," in Design, Automation and Test in Europe, 2004, pp. 260-265.
11. M. Iyer, G. Parthasarathy, and K. Cheng, "SATORI - a fast sequential SAT engine for circuits." in Int'l Conf. on CAD, 2003, pp. 320-325.
12. G. De Micheli, Synthesis and Optimization of Digital Circuits. McGraw-Hill, Inc., 1994.
13. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," in Design Automation Conf, 2001, pp. 530-535.
14. S. Safarpour, "Managing circuit don't cares in Boolean satisfiability," Master's thesis, Department of Electrical and Computer Engineering, Univeristy of Toronto, 2005. [Online]. Available: http://www.eecg.toronto.edu/~sean/thesis.pdf