Skip to main content
SpringerLink
Log in

Nondeterminism, parallelism and intermittent assertions

  • Conference paper
  • First Online:
Mathematical Studies of Information Processing

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

Abstract

Different views on nondeterminism and their effect on correctness proofs are investigated. These include allowing or disallowing dead ends and/or nontermination. A simple model of transition systems is used for this treatment, and a generalization of intermittent assertions is introduced which allows referencing the program path. Parallelism is considered as a special kind of nondeterminism. An additional proof rule is required for parallel programs, to express a fair scheduling policy. As an application, a total correctness proof of Dijkstra's on-the-fly garbage collection algorithm is sketched.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burstall, R.M., Proving properties of programs by structural induction. Comput.J. 12, Feb. 1969, 41–48.

    Google Scholar 

  2. Colomb, S.W., and Baumert, L.D., Backtrack programming. J. ACM 12, Oct. 1965, 516–524.

    Google Scholar 

  3. Dijkstra, E.W., A discipline of programming. Prentice-Hall, 1976.

    Google Scholar 

  4. Dijkstra, E.W., et.al. On-the-fly garbage collection: an exercise in cooperation. In Lecture Notes in Computer Science 46, Springer-Verlag, 1976, 43–56.

    Google Scholar 

  5. Floyd, R.W., Assigning meaning to programs. Proc.Symp. in Applied Math. 19, J.T.Schwartz, Ed., Amer.Math.Soc., 1967, 19–32.

    Google Scholar 

  6. Gries, David, An exercise in proving parallel programs correct. Comm. ACM 20, Dec. 1977, 921–930.

    Google Scholar 

  7. Manna, Zohar, Mathematical theory of computation. McGraw-Hill, 1974.

    Google Scholar 

  8. Manna, Zohar, and Waldinger Richard, Is "sometime" sometimes better than "always"? Comm. ACM 21, Feb. 1978, 159–172.

    Google Scholar 

  9. Morris, J.H., and Wegbreit, B., Subgoal induction. Comm. ACM 20, April 1977, 209–222.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, University of Tampere, Tampere, Finland

    R. Kurki-Suonio

Authors
  1. R. Kurki-Suonio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. K. Blum M. Paul S. Takasu

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kurki-Suonio, R. (1979). Nondeterminism, parallelism and intermittent assertions. In: Blum, E.K., Paul, M., Takasu, S. (eds) Mathematical Studies of Information Processing. Lecture Notes in Computer Science, vol 75. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09541-1_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-09541-1_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09541-5

  • Online ISBN: 978-3-540-35010-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation