Vectorized symbolic model checking of computation tree logic for sequential machine verification
- 1 January 1992
- book chapter
- Published by Springer Nature
- p. 214-224
- https://doi.org/10.1007/3-540-55179-4_21
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Design and synthesis of synchronization skeletons using branching time temporal logicPublished by Springer Nature ,2005
- Implicit state enumeration of finite state machines using BDD'sPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A parallel algorithm for constructing binary decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Breadth-first manipulation of SBDD of Boolean functions for vector processingPublished by Association for Computing Machinery (ACM) ,1991
- 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
- Sequential circuit verification using symbolic model checkingPublished by Association for Computing Machinery (ACM) ,1990
- Shared binary decision diagram with attributed edges for efficient Boolean function manipulationPublished by Association for Computing Machinery (ACM) ,1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Binary Decision DiagramsIEEE Transactions on Computers, 1978