Efficient Verification with BDDs using Implicitly Conjoined Invariants

@inproceedings{Hu1993EfficientVW,
  title={Efficient Verification with BDDs using Implicitly Conjoined Invariants},
  author={Alan J. Hu and David L. Dill},
  booktitle={CAV},
  year={1993}
}
Many researchers have reported that using Boolean decision diagrams (BDDs) greatly increases the size of hardware designs that can be formally verified automatically. Our own experience with automatic verification of high-level aspects of hardware design, such as protocols for cache coherence and communications, contradicts previous results; in fact, BDDs have been substantially inferior to brute-force algorithms that store states explicitly in a table. We believe that new techniques are needed… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Automatic Verification of Synchronous Circuits Using Symbolic Logic Simulation and Temporal Logic,

  • S. Bose, A. Fisher
  • IMEC-IFIP International Workshop on Applied…
  • 1989
Highly Influential
10 Excerpts

Long, “Symbolic Model Checking with Partitioned Transition Relations,

  • J. R. Burch, E. M. Clarke, D.E
  • VLSI ’91: Proceedings of the IFIP TC 10/WG 10.5…
  • 1991

Similar Papers

Loading similar papers…