Extended BDDs: Trading of canonicity for structure in verification algorithms
- 1 February 1994
- journal article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 4 (2) , 167-185
- https://doi.org/10.1007/bf01384083
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- New ATPG techniques for logic optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Logic verification using binary decision diagrams in a logic synthesis environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Probabilistic design verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- ATPG aspects of FSM verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Finding the optimal variable ordering for binary decision diagramsIEEE Transactions on Computers, 1990
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- Logic verification algorithms and their parallel implementationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Verification algorithms for VLSI synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Representation of Switching Circuits by Binary-Decision ProgramsBell System Technical Journal, 1959