Node addition and removal in the presence of don't cares

Proceedings - Design Automation Conference

Volumn , Issue , 2010, Pages 505-510

  Chen, Yung Chih ^a   Wang, Chun Yao ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Logic implication; Node addition and removal; Node merging; Observability don't care

Indexed keywords

COMPETITIVE CAPABILITIES; LOGIC IMPLICATION; LOGIC RESTRUCTURING; MERGING TECHNIQUES; NODE ADDITION AND REMOVAL; NODE MERGING; REDUNDANCY REMOVAL; SUFFICIENT CONDITIONS; TARGET NODES;

COMPUTER AIDED DESIGN; OBSERVABILITY; OPTIMIZATION;

MERGING;

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

References (15)

1. M. S. Abadir, J. Ferguson, and T. E. Kirkland, "Logic Design Verification via Test Generation," IEEE Trans. Computer-Aided Design, vol.7, pp. 138-148, Jan. 1988.
2. M. Abramovici, M. A. Breuer, and A. D. Friedman, Digital Systems Testing and Design for Testability, IEEE Press, 1990.
3. Berkeley Logic Synthesis and Verification Group, "ABC: A System for Sequential Synthesis and Verification," http://www.eecs.berkeley.edu/ ~alanmi/abc/.
4. M. Case, V. Kravets, A. Mishchenko, and R. Brayton, "Merging Nodes Under Sequential Observability," in Proc. Design Automation Conf., 2008, pp. 540-545.
5. Y. C. Chen and C. Y. Wang, "Fast Detection of Node Mergers Using Logic Implications," in Proc. Int. Conf. on Computer-Aided Design, 2009, pp. 785-788.
6. T. Kirkland and M. R. Mercer, "A Topological Search Algorithm for ATPG," in Proc. Design Automation Conf., 1987, pp. 502-508.
7. A. Kuehlmann, "Dynamic Transition Relation Simplification for Bounded Propery Checking," in Proc. Int. Conf. on Computer-Aided Design, 2004, pp. 50-57.
8. A. Kuehlmann, V. Paruthi, F Krohm, and M. K. Ganai, "Robust Boolean Reasoning for Equivalence Checking and Functional Property Verification," in IEEE Trans. Computer-Aided Design, vol.21, pp. 1377-1394, Dec. 2002.
9. W. Kunz and D. K. Pradhan, "Recursive Learning: An New Implication Technique for Efficient Solutions to CAD Problems - Test, Verification, and Optimization," in IEEE Trans. Computer-Aided Design, vol.13, pp. 1143-1158, Sep. 1994.
10. A. Mishchenko, S. Chatterjee, and R. Brayton, "DAG-Aware AIG Rewriting: A Fresh Look at Combinational Logic Synthesis," in Proc. Design Automation Conf., 2006, pp. 532-536.
11. A. Mishchenko, S. Chatterjee, R. Brayton, and N. Een, "Improvements to Combinational Equivalence Checking, " in Proc. Int. Conf. on Computer-Aided Design, 2006, pp. 836-843.
12. S. Plaza, K. H. Chang, I. Markov, and V. Bertacco, "Node Mergers in the Presence of Don't Cares," in Proc. Asia South Pacific Design Automation Conf., 2007, pp. 414-419.
13. M. H. Schulz and E. Auth, "Advanced Automatic Test Pattern Generation and Redundancy Identification Techniques," in Proc. Int. Fault-Tolerant Computing Symp., 1988, pp. 30-35.
14. Q. Zhu, N. Kitchen, A. Kuehlmann, and A. Sangiovanni-Vincentelli, "SAT Sweeping with Local Observability Don't Cares," in Proc. Design Automation Conf., 2006, pp. 229-234.
15. http://iwls.org/iwls2005/benchmarks.html.