Abstract
In symbolic model checking, the behavior of a model to be verified is captured by the transition relation of the state space implied by the model. Unfortunately, the size of the transition relation grows rapidly with the number of states even for small models, rendering them impossible to verify. A recent work
This paper describes a criterion for ordering partitions which is independent of the circuit details. Based on this criterion, a heuristic algorithm for ordering partitions is described. The algorithm, which may be used in preparation for each symbolic simulation step, has been successfully implemented and has resulted in significant speed-ups of symbolic model checking. Specifically, this algorithm has made it possible to verify blocks inside an example microprocessor. The run time results are given here.
Chapter PDF
References
Ilan Beer, Michael Yoeli, Shoham Ben-David, and Daniel Geist. Methodology and System for Practical Formal Verification of Reactive Hardware. Accepted to CAV 94, 1994.
Karl. S. Brace, Richard L. Rudell, and Randal E. Bryant. Efficient Implentation of a BDD Package. In 27th ACM/IEEE Design Automation Conference, pages 40–45. ACM/IEEE, 1990.
Randal E. Bryant. Graph based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35, 1986.
Randal E. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24:298–318, September 1992.
Jerry R. Burch, Edmund M. Clarke, and David E. Long. Symbolic Model Checking with Partitioned Transition Relations. In International Conference on Very Large Scale Integration, Edinburg, Scotland, August 1991. IFIP.
Edmund M. Clarke, Orna Grumberg, Hiromi Hiraishi, Somesh Jha, David L. Long, Kenneth L. McMillan, and Linda A. Ness. Verification of the Futurebus+ Cache Coherence Protocol. In Proceedings of the 11th International Conference on Computer Hardware Description Languages, pages 15–30, 1993.
Olivier Coudert, Jean C. Madre, and Christian Berthet. Verifying Temporal Properties of Sequential Machines Without Building their State Diagrams. In R. Kurshan and E. M. Clarke, editors. Workshop on Computer Aided Verification, DIMACS, pages 75–84. American Mathematical Society, Providence, RI, 1990.
Alan J. Hu and David L. Dill. Efficient Verification with BDDs using Implicitly Conjoined Invariants. In Proceedings of the Conference on Computer Aided Verification (CAV 93), 1993.
K. L. McMillan. The SMV System DRAFT. Carnegie Mellon University, Pittsburgh, PA, 1992.
K. L. McMillan and J. Schwalbe. Formal verification of the Encore Gigamax cache consistency protocol. In Proceedings of the 1991 International Symposium on Shared Memory Multiprocessors, April 1991.
Kenneth L. McMillan. Symbolc Model Checking. PhD thesis, Carnegie Mellon University, May 1992.
H. J.Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli. Implicit State Enumeration of Finite State Machines usin BDD's. In IEEE International Conference on CAD, pages 130–133, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geist, D., Beer, I. (1994). Efficient model checking by automated ordering of transition relation partitions. In: Dill, D.L. (eds) Computer Aided Verification. CAV 1994. Lecture Notes in Computer Science, vol 818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58179-0_63
Download citation
DOI: https://doi.org/10.1007/3-540-58179-0_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58179-6
Online ISBN: 978-3-540-48469-1
eBook Packages: Springer Book Archive