Approximate reachability with BDDs using overlapping projections

Authors:
Shankar G. Govindaraju;David L. Dill;Alan J. Hu;Mark A. Horowitz
Affiliations:
Computer Systems Laboratory, Stanford University, Stanford, CA;Computer Systems Laboratory, Stanford University, Stanford, CA;Department of Computer Science, University of British Columbia, Vancouver, B.C, Canada V6T 1Z4;Computer Systems Laboratory, Stanford University, Stanford, CA
Venue:
DAC '98 Proceedings of the 35th annual Design Automation Conference
Year:
1998

Citing 5
Cited 25

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
The Stanford FLASH multiprocessor

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Automatic state space decomposition for approximate FSM traversal based on circuit analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Algorithms for approximate FSM traversal based on state space decomposition

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Approximate reachability don't cares for CTL model checking

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Verification by approximate forward and backward reachability

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Symbolic reachability analysis of large finite state machines using don't cares

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Improved approximate reachability using auxiliary state variables

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Least fixpoint approximations for reachability analysis

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Probabilistic state space search

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Combinational and sequential equivalence checking

Logic Synthesis and Verification
The future of logic synthesis and verification

Logic Synthesis and Verification
SIVA: A System for Coverage-Directed State Space Search

Journal of Electronic Testing: Theory and Applications
Counterexample-guided choice of projections in approximate symbolic model checking

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Smart simulation using collaborative formal and simulation engines

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Symbolic Simulation with Approximate Values

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Techniques for Smaller Intermediary BDDs

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Overapproximating Reachable Sets by Hamilton-Jacobi Projections

Journal of Scientific Computing
The Compositional Far Side of Image Computation

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Utilizing don't care states in SAT-based bounded sequential problems

GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
Transition-by-transition FSM traversal for reachability analysis in bounded model checking

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
A Survey of Hybrid Techniques for Functional Verification

IEEE Design & Test
Dependent latch identification in the reachable state space

Proceedings of the 2009 Asia and South Pacific Design Automation Conference
Dependent-latch identification in reachable state space

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Exploiting Target Enlargement and Dynamic Abstraction within Mixed BDD and SAT Invariant Checking

Electronic Notes in Theoretical Computer Science (ENTCS)
Relay Reachability Algorithm for Exploring Huge State Space

Electronic Notes in Theoretical Computer Science (ENTCS)
Parallelizing a symbolic compositional model-checking algorithm

HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Approximate reachability tec hniques trade off accuracy with the capacity to deal with bigger designs. Cho et al [3] proposed approximate FSM traversal algorithms over a partition of the set of state bits. In this paper w egeneralize it by allowing projectionson to a collection of nondisjoint subsets of the state variables. We establish the adv an tageof ha ving overlapping projections and present a new multiple constr ainfunction for BDDs, to compute efficiently the approximate image during symbolic forward propagation using overlapping projections. We demonstrate the effectiveness of this new algorithm by applying it to several control modules from the I/O unit in the Stanford FLASH Multiprocessor. We also present our results on the larger ISCAS 89 benchmarks.