Proof rules dealing with fairness
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.
- 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
- 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
- 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