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.
The first author would like to thank Siemens AG for making this research possible with a summer internship.
Chapter PDF
Similar content being viewed by others
Keywords
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
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
David Long. Model Checking, Abstraction, and Compositional Verification. PhD thesis, Carnegie Mellon University, July 1993.
Robin Milner. Communication and Concurrency. Prentise Hall, 1989.
Frank Pfenning. Elf: A meta-language for deductive systems. In Proceedings of CADE-12, volume LNAI 814, pages 811–815. Springer Verlag, 1994.
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.
Karl Stroetmann and Claus Bendix Nielsen, editors. A Guide to Seduct. Siemens AG, Munich, Germany, 1994.
Pierre Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proceedings of Principles of Programming Languages 1986, pages 184–193, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dingel, J., Filkorn, T. (1995). Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving. In: Wolper, P. (eds) Computer Aided Verification. CAV 1995. Lecture Notes in Computer Science, vol 939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60045-0_40
Download citation
DOI: https://doi.org/10.1007/3-540-60045-0_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60045-9
Online ISBN: 978-3-540-49413-3
eBook Packages: Springer Book Archive