Checking equivalence for partial implementations

Proceedings - Design Automation Conference

Volumn , Issue , 2001, Pages 238-243

  Scholl, C ^a   Becker, B ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; ERROR DETECTION; FORMAL LOGIC;

COMBINATIONAL EQUIVALENCE;

COMBINATORIAL CIRCUITS;

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

References (19)

1. Graph - Based algorithms for Boolean function manipulation
2. Symbolic Boolean manipulation with ordered binary decision diagrams
3. 20 states and beyond
4. An approach to unified methodology of combinational switching circuits
5. Spectral transforms for large Boolean functions with application to technology mapping
6. Verification of sequential machines based on symbolic execution
7. Using SAT for combinational equivalence checking
8. Verification of designs containing black boxes
9. Testing, verification, and diagnosis in the presence of unknowns
10. Equivalence checking using cuts and heaps
11. GRASP - A new search algorithm for satisfiability
12. Combinational equivalence checking using satisfiability and recursive learning
13. To split or to conjoin: The question in image computation
14. Dynamic variable ordering for ordered binary decision diagrams
15. A SAT-based implication engine for efficient ATPG, equivalence checking, and optimization of netlists
16. Permissible functions for multioutput components in combinational logic optimization