Skip to main content

The modal logic of programs

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 71))

Included in the following conference series:

Abstract

We explore the general framework of Modal Logic and its applicability to program reasoning. We relate the basic concepts of Modal Logic to the programming environment: the concept of "world" corresponds to a program state, and the concept of "accessibility relation" corresponds to the relation of derivability between states during execution. Thus we adopt the Temporal interpretation of Modal Logic. The variety of program properties expressible within the modal formalism is demonstrated.

The first axiomatic system studied, the sometime system, is adequate for proving total correctness and ‘eventuality’ properties. However, it is inadequate for proving invariance properties. The stronger nexttime system obtained by adding the next operator is shown to be adequate for invariances as well.

This is a preliminary abridged version of a forthcoming Technical Report, Computer Science Department, Stanford University.

This research was supported in part by the National Science Foundation under Grant MCS76-83655 and by the Advanced Research Projects Agency of the Department of Defense under Contract MDA903-76-C-0206.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burstall, R.M. "Formal Description of Program Structure and Semantics of First-Order Logic", in Machine Intelligence 5, B. Meltzer and D. Michie (eds.), Edinburgh Press, pp. 79–98 (1970).

    Google Scholar 

  2. Constable, R.L. "On the Theory of Programming Logic", Proceedings of the 9th Annual Symposium on Theory of Computing, Boulder, Colorado (May 1977).

    Google Scholar 

  3. Harel, D. "Logic of Programs: Axiomatic and Descriptive Power", Ph.D. Thesis, Laboratory of Computer Science, M.I.T. (May 1978).

    Google Scholar 

  4. Hoare, C.A.R. "An Axiomatic Basis of Computer Programming", CACM, Vol.12, No. 10 (October 1969).

    Google Scholar 

  5. Hughes, G.E. and Cresswell, M.J. "An Introduction to Modal Logic", Methuess & Co., London (1968).

    Google Scholar 

  6. Manna, Z. and Waldinger, R. "Is 'sometime’ Sometimes Better Than ‘Always'?: Intermittent Assertions in Proving Program Correctness", CACM, Vol. 21, No. 2 (February 1978), pp. 159–172.

    Google Scholar 

  7. Pnueli, A. "The Temporal Semantics of Concurrent Programs", Technical Report, Tel-Aviv University (1978).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manna, Z., Pnueli, A. (1979). The modal logic of programs. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics