A simple fixpoint argument without the restriction to continuity
In programming language semantics, the introduction of unbounded nondeterminacy, which amounts to the introduction of noncontinuous predicate transformers, is needed for dealing with such concepts as fair interleaving. With the semantics of the repetition given as the strongest solution of a fixpoint equation, the weakest precondition expressed in closed form would then require transfinite ordinals. Here, however, it is shown that, even in the case of unbounded nondeterminacy, the fundamental theorem about the repetition can be proved by a simple and quite elementary argument.
KeywordsInformation System Operating System Data Structure Communication Network Information Theory
Unable to display preview. Download preview PDF.
- 1.Back, R.J.R.: Correctness preserving program refinements: proof theory and applications. Math. Cent. Tracts 131, (1980)Google Scholar
- 4.Dijkstra, E.W.: A discipline of programming. Englewood Cliffs. Prentice-Hall 1976Google Scholar
- 6.Park, D.: On the semantics of fair parallelism. Lect. Notes Comput. Sci. Vol. 86, pp. 504–526. Berlin, Heidelberg, New York: Springer 1980Google Scholar
- 7.Park, D.: Concurrency and automata on infinite sequences. Lect. Notes Comput. Sci. Vol. 104, Berlin, Heidelberg, New York: Springer 1981Google Scholar
- 8.Stoy, J.: Denotational Semantics. In: The Scott-Strachey Approach to Programming. Cambridge: MIT Press 1977Google Scholar