Representing Circuits More Efficiently in Symbolic Model Checking

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… CONTINUE READING

2 Figures & Tables

Statistics

051015'93'96'99'02'05'08'11'14'17
Citations per Year

169 Citations

Semantic Scholar estimates that this publication has 169 citations based on the available data.

See our FAQ for additional information.