Skip to main content
SpringerLink
Log in

The Schorr-Waite graph marking algorithm

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

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.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Floyd, R.W.: Assigning meanings to programs. Proc. Amer. Math. Soc. (Symp. in Applied Math.) 19, 19–31 (1967)

    Google Scholar 

  2. Hoare, C.A.R.: An axiomatic basis for computer programming. Comm. ACM 12, 576–580, 583 (1969)

    Google Scholar 

  3. Dijkstra, E.W.: A discipline of programming. Englewood Cliffs, N.J.: Prentice-Hall 1976

    Google Scholar 

  4. Schorr, H., Waite, W.M.: An efficient machine-independent procedure for garbage collection in various list structures. Comm. ACM 10, 501–506 (1967)

    Google Scholar 

  5. Burstall, R.M.: Program proving as hand simulation with a little induction. Proc. IFIP Congress pp. 308–312, 1974

  6. Manna, Z., Waldinger, R.: Is “sometime” sometimes better than “always”? Intermittent assertions in proving program correctness. Comm. ACM 21, 159–172 (1978)

    Google Scholar 

  7. Gries, D.: The multiple assignment statement. IEEE Trans. Software Engrg. SE-4, 89–93 (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, Upson Hall, 14853, Ithaca, NY, USA

    David Gries

Authors
  1. David Gries
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported by the National Science Foundation under Grant MCS76-22360

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gries, D. The Schorr-Waite graph marking algorithm. Acta Informatica 11, 223–232 (1979). https://doi.org/10.1007/BF00289068

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00289068

Keywords

Search

Navigation