Advertisement

Hierarchical representations of discrete functions, with application to model checking

  • K. L. McMillan
Symbolic Verification 1
Part of the Lecture Notes in Computer Science book series (LNCS, volume 818)

Abstract

BDD trees provide a hierarchically structured canonical representation for boolean functions, based on ordered binary decision diagrams (OBDD's). We describe algorithms for function application and boolean quantification on BDD trees, allowing them to be used in applications such as symbolic model checking. Experimentally, we find that BDD trees can be greatly more efficient than ordinary OBDD's in verifying tree structured systems using symbolic model checking. In one case, sublinear growth is observed in the size of the transition relation representation. Analytically, we find that for a class of circuits of fixed tree width, BDD trees are asymptotically efficient.

Keywords

Equivalence Class Model Check Boolean Function Transition Relation Tree Decomposition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [BCL91]
    Jerry R. Burch, Edmund M. Clarke, and David E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P. B. Denyer, editors, Proceedings of the IFIP International Conference on Very Large Scale Integration, Edinburgh, Scotland, August 1991.Google Scholar
  2. [BCM+90]
    J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.Google Scholar
  3. [Bod93]
    H. L. Bodlaender. A linear time agorithm for finding tree-decompositions of small treewidth. In ACM STOC '93 (25th), CA, USA, May 1993.Google Scholar
  4. [Bry86]
    R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8), 1986.Google Scholar
  5. [Dil88]
    D. Dill. Trace theory for automatic hierarchical verification of speedindependent circuits. Technical Report 88–119, Carnegie Mellon University, Computer Science Dept, 1988.Google Scholar
  6. [McM92]
    K. L. McMillan. Symbolic model checking: an approach to the state explosion problem. Technical Report 92–131, Carnegie Mellon University, Computer Science Dept, 1992.Google Scholar
  7. [MS91]
    K. L. McMillan and J. Schwalbe. Formal verification of the Encore Gigamax cache consistency protocol. In International Symposium on Shared Memory Multiprocessors, 1991.Google Scholar
  8. [RS86]
    N. Robertson and P. D. Seymour. Graph minors. II. algorithmic aspects of tree-width. J. Algorithms, 7:309–322, 1986.CrossRefGoogle Scholar
  9. [Sei80]
    C. L. Seitz. Ideas about arbiters. Lambda, 10(14), 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • K. L. McMillan
    • 1
  1. 1.AT&T Bell LaboratoriesMurray Hill

Personalised recommendations