Skip to main content
SpringerLink
Log in

Transformations realizing fairness assumptions for parallel programs

  • Invited Lectures
  • Conference paper
  • First Online:
STACS 84 (STACS 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 166))

Included in the following conference series:

  • 108 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.R. Apt, E.-R. Olderog, Proof rules and transformations dealing with fairness, Science of Computer Programming 3 (1983) 65–100; extended abstract appeared in: D. Kozen (Ed.), Proc. Logics of Programs 1981, Lecture Notes in Computer Science 131 (Springer, Berlin, 1982) 1–8.

    Google Scholar 

  2. K.R. Apt, G.D. Plotkin, Countable nondeterminism and random assignment, Technical Report, Univ. of Edinburgh (1982); extended abstract appeared in: S. Even, O. Kariv (Eds.), Proc. 8th Coll. Automata, languages and Programming, Lecture Notes in Computer Science 115 (Springer, Berlin, 1981) 479–494.

    Google Scholar 

  3. K.R. Apt, A. Pnueli, J. Stavi, Fair termination revisited — with delay, in: Proc. 2nd Conf. on Software Technology and Theoretical Computer Science, Bangalore (1982).

    Google Scholar 

  4. M. Broy, Transformational semantics for concurrent programs, Inform. Proc. Letters 11 (1980) 87–91.

    Google Scholar 

  5. M. Broy, Are fairness assumptions fair?, in: Proc. 2nd Intern. Conf. on Distributed Computing Systems (IEEE, Paris, 1981) 116–125.

    Google Scholar 

  6. E.W. Dijkstra, A Discipline of Programming (Prentice Hall, 1976).

    Google Scholar 

  7. M.J. Fisher, M.S. Paterson, Storage requirements for fair scheduling, Manuscript, Univ. of Warwick (1982).

    Google Scholar 

  8. L. Flon, N. Suzuki, Nondeterminism and the correctness of parallel programs, in: E.J. Neuhold (Ed.), Formal Description of Programming Concepts I (North Holland, Amsterdam, 1978) 589–608.

    Google Scholar 

  9. L. Flon, N. Suzuki, The total correctness of parallel programs, SIAM J. Comp. 10 (1981) 227–246.

    Google Scholar 

  10. N. Francez, Fairness, Unpublished Manuscript, Technion Univ. (1983).

    Google Scholar 

  11. M.C.B. Henessy, G.D. Plotkin, Full abstraction for a simple programming language, in: J. Bečvař (Ed.), Proc. 8th Symp. on Mathematical Foundations of Computer Science 74 (Springer, Berlin, 1979) 108–120.

    Google Scholar 

  12. C.A.R. Hoare, Some properties of predicate transformers, J. ACM 25 (1978) 461–480.

    Google Scholar 

  13. D. Lehmann, A. Pnueli, J. Stavi, Impartiality, justice and fairness: the ethics of concurrent termination, in: S. Even, O. Kariv (Eds.), Proc. 8th Coll. Automata, Languages and Programming, Lecture Notes in Computer Science 115 (Springer, Berlin, 1981) 264–277.

    Google Scholar 

  14. Z. Manna, A. Pnueli, Verification of concurrent programs: the temporal framework, in: R.S. Boyer, J.S. Moore (Eds.), The Correctness Problem in Computer Science, International Lecture Series in Computer Science (Academic Press, London, 1981).

    Google Scholar 

  15. S. Owicki, D. Gries, An axiomatic proof technique for parallel programs, Acta Informatica 6 (1976) 319–340.

    Google Scholar 

  16. S. Owicki, L. Lamport, Proving liveness properties of concurrent programs, ACM TOPLAS 4 (1982) 455–495.

    Google Scholar 

  17. D. Park, On the semantics of fair parallelism, in: D. Bjørner (Ed.), Proc. Abstract Software Specifications, Lecture Notes in Computer Science 86 (Springer, Berlin, 1979) 504–526.

    Google Scholar 

  18. G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI-FN 19, Comp. Sci. Dept., Aarhus Univ. (1981).

    Google Scholar 

  19. A. Pnueli, The temporal semantics of concurrent programs, Theoretical Computer Science 13 (1981) 45–60.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP Université Paris VII, 75251, Paris

    K. R. Apt

  2. Institut für Informatik, Universität Kiel, D-2300, Kiel 1

    E. -R. Olderog

Authors
  1. K. R. Apt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. -R. Olderog
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Fontet K. Mehlhorn

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/3-540-12920-0_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-12920-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12920-2

  • Online ISBN: 978-3-540-38805-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation