Advertisement

Implementation of Propositional Temporal Logics Using BDDs

  • G. L. J. M. Janssen
Conference paper
  • 222 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1397)

Abstract

This tutorial intends to convey the step-by-step process by which computer programs for model checking and satisfiability testing for temporal logics may be derived from the theory. The idea is to demonstrate that it is very well possible to implement such a program in an efficient way without sacrificing a correct-by-construction approach. The tutorial will be fully self-contained, only a general knowledge of programming and propositional logic is assumed.

References

  1. 1.
    Z. Manna, A. Pnueli, “Verification of concurrent programs: the temporal framework,” The Correctness Problem in Computer Science, eds. Robert S. Boyer, J. Strother Moore, International Lecture Series in Computer Science, Academic Press, New York, 1981.Google Scholar
  2. 2.
    J.R. Burch, E.M. Clarke, K.L. McMillan, “Symbolic Model Checking: 1020 States and Beyond,” International Workshop on Formal Methods in VLSI Design, 1991.Google Scholar
  3. 3.
    E. Clarke, O. Grumberg, K. Hamaguchi, “Another Look at LTL Model Checking,” Proceeding 6-th Int. Conf. on Computer Aided Verification, Springer-Verlag, LNCS 818, ed. David L. Dill, pp. 415–427.Google Scholar
  4. 4.
    Geert L.J.M. Janssen, “Hardware Verification using Temporal Logic: A Practical View,” Formal VLSI Correctness Verification, VLSI Design Methods-II, Elsevier Science Publishers B.V. (North-Holland), ed. L.J.M. Claesen, IFIP, 1990, pp. 159–168.Google Scholar
  5. 5.
    Randal E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Transactions on Computers, Vol. C-35, Nr. 8, August 1986.Google Scholar
  6. 6.
    Karl S. Brace, Richard L. Rudell, Randal E. Bryant, “Efficient Implementation of a BDD Package,” Proceedings Design Automation Conference, June 1990.Google Scholar
  7. 7.
    Kenneth L. McMillan, Symbolic Model Checking, Kluwer Academic Publishers, 1993.Google Scholar
  8. 8.
    E.A. Emerson, “Chapter 16: Temporal and Modal Logic,” Handbook of Theoretical Computer Science, B: Formal Models and Semantics, ed. Jan van Leeuwen, Elsevier Science Publishers B.V., 1990, pp. 996–1072.Google Scholar
  9. 9.
    Rance Cleaveland, “Tableau-Based Model Checking in the Propositional Mu-Calculus,” Acta Informatica, No. 27, 1990, pp. 725–747.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • G. L. J. M. Janssen
    • 1
  1. 1.Department of Electrical EngineeringEindhoven University of TechnologyEindhoven

Personalised recommendations