A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits
Authors:
- 1 November 2002
- journal article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 21 (3) , 317-338
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Distributed binary decision diagrams for verification of large circuits2002
- Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification2000
- Improving the efficiency of BDD-based operators by means of partitioningIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1999
- On-the-fly model checking of RCTL formulas1998
- Parallelizing the Murϕ verifier1997
- Symbolic Model Checking1993
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Implementing Remote procedure calls1983