Transformations realizing fairness assumptions for parallel programs
- First Online:
- Cite this paper as:
- Apt K.R., Olderog E.R. (1984) Transformations realizing fairness assumptions for parallel programs. In: Fontet M., Mehlhorn K. (eds) STACS 84. STACS 1984. Lecture Notes in Computer Science, vol 166. Springer, Berlin, Heidelberg
Parallel programs with shared variables are studied under a semantics which assumes the fair execution of all parallel components. We present transformations which reduce this fair semantics to a simple interleaving semantics with help of random assignments z:=?. In fact, different notions of fairness are considered: impartiality, liveness, weak and strong fairness. All transformations preserve the structure of the original programs and are thus suitable as a basis for syntax-directed correctness proofs.
Unable to display preview. Download preview PDF.