Skip to main content
SpringerLink
Log in
Book cover

Program Construction pp 58–69Cite as

The Schorr-Waite graph marking algorithm

  • I. The Thinking Programmer
  • Chapter
  • First Online:

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

Abstract

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 research was supported by the National Science Foundation under grant MCS76-22360.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  3. Dijkstra, E.W. A Discipline of Programming. Prentice-Hall, 1976.

    Google Scholar 

  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.

    Article  Google Scholar 

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

    Google Scholar 

  6. Manna, Z. and R. Waldinger. Is "sometime" sometimes better than "always"? Intermittent assertions in proving program correctness. CACM 21 (Feb. 1978), 159–172.

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Cornell University, 14853, Ithaca, N.Y., USA

    David Gries

Authors
  1. David Gries
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Friedrich L. Bauer Manfred Broy E. W. Dijkstra S. L. Gerhart D. Gries M. Griffiths J. V. Guttag J. J. Horning S. S. Owicki C. Pair H. Partsch P. Pepper M. Wirsing H. Wössner

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gries, D. (1979). The Schorr-Waite graph marking algorithm. In: Bauer, F.L., et al. Program Construction. Lecture Notes in Computer Science, vol 69. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014658

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09251-3

  • Online ISBN: 978-3-540-35312-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation