Skip to main content
SpringerLink
Log in

A Proof of the Schorr-Waite Algorithm

  • Chapter
Theoretical Foundations of Programming Methodology

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 91))

Abstract

The preceding two papers laid a theoretical foundation for verifying list-processing programs. The present paper exercises the formalism in a verification of that most recalcitrant algorithm, the Schorr-Waite graph-marking algorithm.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Schorr, H., and Waite, W.M.: “An Efficient Machine-Independent Procedure for Garbage Collection in Various List Structures,” Comm. ACM, Vol. 10, No. 8, 1967, pp. 501–506.

    Article  MATH  Google Scholar 

  2. Topor, R.W.: “The Correctness of the Schorr-Waite List Marking Algorithm,” Acta Informatica, Vol. 11, 1979, pp. 211–221.

    Article  MathSciNet  MATH  Google Scholar 

  3. Gries, D.: “The Schorr-Waite Graph Marking Algorithm,” Acta Informatica, Vol. 11, 1979, pp. 223–232.

    Article  MATH  Google Scholar 

  4. de Roever, W.P.: “On Backtracking and Greatest Fixpoints,” Formal Descriptions of Programming Concepts, E.J. Neuhold (ed.), North-Holland, 1978, pp. 621–636.

    Google Scholar 

  5. Kowaltowski, T.: “Data Structures and Correctness of Programs,” Jrnl. ACM, Vol. 26, No. 2, 1979, pp. 283–301.

    Article  MathSciNet  MATH  Google Scholar 

  6. Yelowitz, L., and Duncan, A.G.: Abstractions, Instantiations, and Proofs of Marking Algorithms, Proc. Symp. Artificial Intelligence and Programming Languages, Sigplan, Vol. 12, No. 8, 1977, pp. 13–21.

    Google Scholar 

  7. Dijkstra, E.W.: “A Discipline of Programming,” Prentice-Hall, Englewood Cliffs, N.J., 1976.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Trinity College, Dublin 2, Ireland

    Joseph M. Morris

Authors
  1. Joseph M. Morris
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik der Technischen Universität München, Germany

    Manfred Broy  & Gunther Schmidt  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1982 D. Reidel Publishing Company

About this chapter

Cite this chapter

Morris, J.M. (1982). A Proof of the Schorr-Waite Algorithm. In: Broy, M., Schmidt, G. (eds) Theoretical Foundations of Programming Methodology. NATO Advanced Study Institutes Series, vol 91. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7893-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-7893-5_5

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-90-277-1462-6

  • Online ISBN: 978-94-009-7893-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation