Advancements in symbolic traversal techniques
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 155-166
- https://doi.org/10.1007/bfb0021721
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
- A new decomposition method for multilevel circuit designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Symbolic model checking: 10/sup 20/ states and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- ATPG aspects of FSM verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Implicit state enumeration of finite state machines using BDD'sPublished 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
- A new model for improving symbolic product machine traversalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Representing circuits more efficiently in symbolic model checkingPublished by Association for Computing Machinery (ACM) ,1991
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986