Transformations realizing fairness assumptions for parallel programs

  • K. R. Apt
  • E. -R. Olderog
Invited Lectures

DOI: 10.1007/3-540-12920-0_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 166)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1984

Authors and Affiliations

  • K. R. Apt
    • 1
  • E. -R. Olderog
    • 2
  1. 1.LITP Université Paris VIIParis
  2. 2.Institut für InformatikUniversität KielKiel 1

Personalised recommendations