The Schorr-Waite graph marking algorithm

  • David Gries
I. The Thinking Programmer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 69)


An explanation is given of the Schorr-Waite algorithm for marking all nodes of a directed graph that are reachable from one given node, using the axiomatic method.


Span Tree Directed Graph Original Graph Loop Body Proof Method 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Floyd, R.W. Assigning meanings to programs. Proc. Amer. Math. Soc. Symp. in Applied Math 19 (1967), 19–31.Google Scholar
  2. [2]
    Hoare, C.A.R. An axiomatic basis for computer programming. CACM 12 (Oct. 1969), 576–580, 583.Google Scholar
  3. [3]
    Dijkstra, E.W. A Discipline of Programming. Prentice-Hall, 1976.Google Scholar
  4. [4]
    Schorr, H. and W.M. Waite. An efficient machine-independent procedure for garbage collection in various list structures. CACM 10 (Aug. 1967), 501–506.Google Scholar
  5. [5]
    Burstall, R.M. Program proving as hand simulation with a little induction. Proc. IFIP Congress 1974, 308–312.Google Scholar
  6. [6]
    Manna, Z. and R. Waldinger. Is "sometime" sometimes better than "always"? Intermittent assertions in proving program correctness. CACM 21 (Feb. 1978), 159–172.Google Scholar
  7. [7]
    Gries, D. The multiple assignment statement. IEEE Trans. Software Engineering, SE-4 (March 1978), 89–93.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • David Gries
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthaca

Personalised recommendations