Skip to main content
SpringerLink
Log in

Finding the correctness proof of a concurrent program

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1978 (MFCS 1978)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  • EWD622 "On making solutions more and more fine-grained." by Edsger W.Dijkstra.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Plataanstraat 5, 5671 AL, NUENEN, The Netherlands

    Edsger W. Dijkstra

Authors
  1. Edsger W. Dijkstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dijkstra, E.W. (1978). Finding the correctness proof of a concurrent program. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08921-6

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation