[go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Semantics of unbounded nondeterminism

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

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

Included in the following conference series:

Abstract

A program construct is proposed, for which the assumption of bounded nondeterminism is not natural. It is shown that the simple approach of taking the powerdomain of the flat cpo does not produce a correct semantics for programs in which nondeterminism is unbounded. The powerdomain approach is then extended to computation paths, resulting is an essentially operational semantics for programs of unbounded nondeterminism.

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.

Similar content being viewed by others

References

  1. BACK: On the correctness of refinement steps in program development. Dept. of Computer Science, Univ. of Helsinki, Report A-1978-4.

    Google Scholar 

  2. BACK: Semantics of unbounded nondeterminism. Computing Centre of Univ. of Helsinki, Res. Rep. No 8, 1979.

    Google Scholar 

  3. de BAKKER: Semantics of infinite processes using generalised trees. Math. Centrum Report IW 82/77.

    Google Scholar 

  4. BAUER: Design of a programming language for a program transformation system. GI-8. Jahrestagung, Informatik Fachbereich 16, Springer Verlag.

    Google Scholar 

  5. BOOM: A weaker precondition for loops. Mathematisch Centrum report IW 104/78.

    Google Scholar 

  6. DIJKSTRA: A discipline of programming. Prentice-Hall, 1976.

    Google Scholar 

  7. DIJKSTRA: Private communication.

    Google Scholar 

  8. FRANCEZ & AL: Semantics of nondeterminism, concurrency and communication. Journal of Computer and System Sciences. Vol. 19, No. 3, December 1979, pp. 290–308.

    Google Scholar 

  9. HAREL & AL: A complete axiomatic system for proving deductions about recursive programs. Proc. 9th annual ACM Symp. on the Theory of Computing, Boulder, Colorado, May 1977.

    Google Scholar 

  10. KOSINSKI: A straightforward denotational semantics for nondeterminant data flow programs. 5th Annual ACM Symposium on Principles of Programming languages, Tucson, January 1978.

    Google Scholar 

  11. PLOTKIN: A powerdomain construction. SIAM J. of Computing 5, 3, September 1976.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisch Centrum, Amsterdam

    Ralph-Johan Back

Authors
  1. Ralph-Johan Back
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Back, RJ. (1980). Semantics of unbounded nondeterminism. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_59

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_59

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

  • Online ISBN: 978-3-540-39346-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation