Advertisement

Semantics of unbounded nondeterminism

  • Ralph-Johan Back
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)

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.

Keywords

Operational Semantic Assignment Statement Execution Path Denotational Semantic Bottom Element 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [78]
    BACK: On the correctness of refinement steps in program development. Dept. of Computer Science, Univ. of Helsinki, Report A-1978-4.Google Scholar
  2. [79]
    BACK: Semantics of unbounded nondeterminism. Computing Centre of Univ. of Helsinki, Res. Rep. No 8, 1979.Google Scholar
  3. [77]
    de BAKKER: Semantics of infinite processes using generalised trees. Math. Centrum Report IW 82/77.Google Scholar
  4. [78]
    BAUER: Design of a programming language for a program transformation system. GI-8. Jahrestagung, Informatik Fachbereich 16, Springer Verlag.Google Scholar
  5. [78]
    BOOM: A weaker precondition for loops. Mathematisch Centrum report IW 104/78.Google Scholar
  6. [76]
    DIJKSTRA: A discipline of programming. Prentice-Hall, 1976.Google Scholar
  7. [78]
    DIJKSTRA: Private communication.Google Scholar
  8. [79]
    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. [77]
    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. [78]
    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. [76]
    PLOTKIN: A powerdomain construction. SIAM J. of Computing 5, 3, September 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Ralph-Johan Back
    • 1
  1. 1.Mathematisch CentrumAmsterdam

Personalised recommendations