Skip to main content
SpringerLink
Log in

Lamport: Verification of concurrent programs

  • Proof Methods For Shared Variable Parallelism
  • Chapter
  • First Online:
A Survey of Verification Techniques for Parallel Programs

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

  • 143 Accesses

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.

2.3.1 References

  1. Lamport, L. The ‘Hoare Logic’ of Concurrent Programs Acta Informatica, Vol. 14, pp. 21–37, 1980.

    Article  Google Scholar 

  2. Owicki, S.S. and Lamport, L. Proving Liveness Properties of Concurrent Programs ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3, July 1982, pp. 455–495.

    Article  Google Scholar 

  3. Lamport, L. A New Approach to Proving the Correctness of Multiprocess Programs ACM Transactions on Programming Languages and Systems, Vol. 1, No. 1, July 1979, pp. 84–97.

    Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1985). Lamport: Verification of concurrent programs. In: A Survey of Verification Techniques for Parallel Programs. Lecture Notes in Computer Science, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-15239-3_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-15239-3_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15239-2

  • Online ISBN: 978-3-540-39416-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation