Representing Circuits More Efficiently in Symbolic Model Checking

@inproceedings{Burch1991RepresentingCM,
  title={Representing Circuits More Efficiently in Symbolic Model Checking},
  author={Jerry R. Burch and Edmund M. Clarke and David E. Long},
  booktitle={DAC},
  year={1991}
}
We significantly reduce the complexity of BDD-based symbolic verification by using partitioned transition relations to represent state transition graphs. On an example pipeline circuit, this technique reduced the verification time by an order of magnitude and the storage requirements for the transition relation by two orders of magnitude. We were also able to handle example pipelines with over l O l Z o reachable states. 
Highly Cited
This paper has 158 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
97 Citations
0 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 97 extracted citations

158 Citations

0510'91'97'04'11'18
Citations per Year
Semantic Scholar estimates that this publication has 158 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…