Advertisement

An exercise in proving parallel programs correct

  • D. Gries
Chapter 1.: Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 46)

Abstract

A parallel program, Dijkstra's on-the-fly garbage collector, is proved correct using a proof method developed by Owicki. The fine degree of interleaving in this program makes it especially difficult to understand, and complicates the proof greatly. Difficulties with proving such parallel programs correct are discussed.

Keywords

Parallel Program Parallel Execution Outgoing Edge Garbage Collection Sequential Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dijkstra, E.W., et al. On-the-fly garbage collection: an exercise in cooperation. In this volume.Google Scholar
  2. 2.
    Hoare, C.A.R. An axiomatic basis for computer programming. CACM 12 (Oct 1969), 576–583.Google Scholar
  3. 3.
    Owicki, S. Axiomatic Proof Techniques for Parallel Programs. TR 75-251, Dept. of Computer Science, Cornell University, July 1975 (PhD thesis).Google Scholar
  4. 4.
    Dijkstra, E.W. Guarded Commands, Nondeterminacy and Formal Derivation of Programs. CACM 18 (Aug 1975), 453–457.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • D. Gries
    • 1
  1. 1.Cornell University and Technical University MunichGermany

Personalised recommendations