Proof rules dealing with fairness

Extended abstract
  • Krzysztof R. Apt
  • Ernst-Rüdiger Olderog
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 131)


We provide proof rules allowing to deal with two fairness assumptions in the context of Dijkstra's do-od programs. These proof rules are obtained by considering a translated version of the original program which uses random assignment x:=? and admits only fair runs. The proof rules use infinite ordinals and deal with the original programs and not their translated versions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    APT, K.R. & G.D. PLOTKIN, A Cook's Tour of countable nondeterminism, Technical Report, Department of Computer Science, University of Edinburgh, 1980 (to appear in Proc. ICALP 81).Google Scholar
  2. [2]
    COUSOT, P., Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice, Rapport de Recherche No 88, L.A.7, Université Scientifique et Medicale de Grenoble, 1977.Google Scholar
  3. [3]
    EMERSON, E.A. & E.M. CLARKE, Characterizing correctness properties of parallel programs using fixpoints, in: Proc. ICALP 80, Lecture Notes in Computer Science 85, Springer Verlag, pp. 169–181, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Krzysztof R. Apt
    • 1
  • Ernst-Rüdiger Olderog
    • 2
  1. 1.Faculty of EconomicsUniversity of RotterdamRotterdamThe Netherlands
  2. 2.Institut für Informatik und Praktische MathematikChristian-Albrechts-Universität KielKiel 1West Germany

Personalised recommendations