A new model for improving symbolic product machine traversal
- 1 January 1992
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 614-619
- https://doi.org/10.1109/dac.1992.227812
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Combinational profiles of sequential benchmark circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Redundancy identification and removal based on implicit state enumerationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- ATPG aspects of FSM verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A unified framework for the formal verification of sequential circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient verifier for finite state machinesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Proving finite state machines correct with an automaton-based methodPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- On the verification of sequential machines at differing levels of abstractionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic CircuitsIEEE Transactions on Computers, 1981