Skip to main content
SpringerLink
Log in
Book cover

Program Construction pp 472–492Cite as

A derivation-oriented proof of the Schorr-Waite marking algorithm

  • III. Program Development By Transformation
  • Chapter
  • First Online:

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

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. Burstall, R. W. and Goguen, J. "Putting Theories Together to Make Specifications", Fifth International Joint Conference on Artificial Intelligence, 1977.

    Google Scholar 

  2. Dahl, O. J. "Can Program Proving Be Made Practical?", Institute of Informatics, University of Oslo, 1978.

    Google Scholar 

  3. Gerhart, S. "Two Proof Techniques for Transferral of Program Correctness", Duke University Computer Science Department Technical Report, revised and submitted for publication.

    Google Scholar 

  4. Gerhart, S. "Proof Theory of Partial Correctness Verification Systems", SIAM Journal of Computing, Vol. 5, No. 3, September 1976.

    Google Scholar 

  5. Gries, D. "The Schorr-Waite Graph Marking Algorithm", Lecture Notes for the International Summer School on Program Construction, Munich, Germany, 1978. (this volume)

    Google Scholar 

  6. Guttag, J. "Notes on Data Abstraction", Lecture Notes for the International Summer School on Program Construction, Munich, Germany, 1978. (this volume)

    Google Scholar 

  7. Knuth, D. The Art of Computer Programming, Vol. I, 1973.

    Google Scholar 

  8. Lee, S., Gerhart, S. L., and deRoever, W. P. "The Evolution of List-copying Algorithms", Sixth ACM Symposium on Principles of Programming Languages, January 1979.

    Google Scholar 

  9. Musser, D. R. "Abstract Data Type Specification in the AFFIRM System", preliminary report available from Information Sciences Institute, November 1978.

    Google Scholar 

  10. Yelowitz, L., and Duncan, A. "Abstractions, Instantiations, and Proofs of Marking Algorithms", Proceedings of the Symposium on Artificial Intelligence and Programming Languages, SIGPLAN and SIGART newsletters, August 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. USC Information Sciences Institute, 4676 Admiralty Way, 90291, Marina del Rey, CA, USA

    Susan L. Gerhart

Authors
  1. Susan L. Gerhart
    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

Gerhart, S.L. (1979). A derivation-oriented proof of the Schorr-Waite 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/BFb0014678

Download citation

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

  • 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