Advertisement

Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving

  • Jürgen Dingel
  • Thomas Filkorn
Session 3: Invited Talk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 939)

Abstract

A method combining data abstraction, model checking and theorem proving is presented. It provides a semi-automatic, formal framework for proving arbitrary linear time temporal logic properties of infinite state reactive systems. The paper contains a complete case study to prove safety and liveness of an implementation of a scheduler for the readers/writers problem which uses unbounded queues and sets. We argue that the proposed framework could be automated to a very large extent making this approach feasible in an industrial environment.

Keywords

Model Check Temporal Logic Theorem Prove Data Abstraction Abstract System 
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. [BCM+92]
    J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142–170, 1992.CrossRefGoogle Scholar
  2. [CE81]
    E.M. Clarke and E.A. Emerson. Synthesis of synchronization skeletons for branching time temporal logic. In Logic of programs: Workshop, Yorktown Heights, NY, May 1981, volume LNCS 131. Springer Verlag, 1981.Google Scholar
  3. [CES86]
    E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. Programming Languages and Systems, 1(2):244–263, 1986.Google Scholar
  4. [CGL92]
    E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages, pages 343–354, New York, 1992. ACM Press.Google Scholar
  5. [DF94]
    J. Dingel and T. Filkorn. Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving. Technical Report ZFE BT SE 1-?, Siemens AG, Corporate Research and Development, Munich, 1994. Draft.Google Scholar
  6. [FPW92]
    T. Filkorn, M. Payer, and P. Warkentin. Symbolic verification of sequential circuits synthesized with CALLAS. In D. Gajski, editor, Proc. 6th International Workshop on High-Level Synthesis, pages 344–353, Laguna Nigel, CA, U.S.A., November 1992. ACM/IEEE.Google Scholar
  7. [FSS+94]
    Th. Filkorn, H.A. Schneider, A. Scholz, A. Strasser, and P. Warkentin. SVE User's Guide. Technical Report ZFE BT SE 1-SVE-1, Siemens AG, Corporate Research and Development, Munich, 1994.Google Scholar
  8. [GL93]
    S. Graf and C. Loiseaux. A tool for symbolic program verification and abstraction. In Computer Aided Verification, 5th International Conference, volume LNCS 697, pages 71–84. Springer Verlag, 1993.Google Scholar
  9. [Gra94]
    S. Graf. Verification of a distributed cache memory by using abstractions. In Computer Aided Verification, 6th International Conference, volume LNCS 818, pages 207–219. Springer Verlag, 1994.Google Scholar
  10. [Hun93]
    Hardi Hungar. Combining model checking and theorem proving to verify parallel processes. In Computer Aided Verification, 5th International Conference, volume LNCS 697, pages 154–165. Springer Verlag, 1993.Google Scholar
  11. [Lon93]
    David Long. Model Checking, Abstraction, and Compositional Verification. PhD thesis, Carnegie Mellon University, July 1993.Google Scholar
  12. [Mil89]
    Robin Milner. Communication and Concurrency. Prentise Hall, 1989.Google Scholar
  13. [Pfe94]
    Frank Pfenning. Elf: A meta-language for deductive systems. In Proceedings of CADE-12, volume LNAI 814, pages 811–815. Springer Verlag, 1994.Google Scholar
  14. [QS81]
    J. Quielle and J. Sifakis. Synthesis of synchronization skeletons for branching time temporal logic. In Proceedings of the 5th International Symposium in Programming, volume LNCS 137. Springer Verlag, 1981.Google Scholar
  15. [SBN94]
    Karl Stroetmann and Claus Bendix Nielsen, editors. A Guide to Seduct. Siemens AG, Munich, Germany, 1994.Google Scholar
  16. [Wol86]
    Pierre Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proceedings of Principles of Programming Languages 1986, pages 184–193, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Jürgen Dingel
    • 1
  • Thomas Filkorn
    • 2
  1. 1.School of Computer ScienceCarnegie Mellon UniversityPittsburghUSA
  2. 2.Corporate Research and DevelopmentSiemens AGMünchenGermany

Personalised recommendations