Skip to main content

Program logics and program verification

  • Conference paper
  • First Online:
Logics of Programs (Logic of Programs 1981)

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

Included in the following conference series:

  • 155 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. L. Lamport The ‘Hoare Logic’ of Concurrent Programs. Acta Informatica to appear, 1980.

    Google Scholar 

  2. L. Lamport 'sometime’ is Sometimes ‘Not Never': A Tutorial on the Temporal Logic of Programs. In Proceedings of the Seventh Annual Symposium on Principles of Programming Languages. ACM SIGACT-SIGPLAN, January, 1980.

    Google Scholar 

  3. S. Owicki and L. Lamport Proving Livness Properties of Programs. Submitted for publication.

    Google Scholar 

  4. S. Owicki and D. Gries. An Axiomatic Proof Technique for Parallel Programs. Acta Informatica 6(4):319–340, 1976.

    Article  Google Scholar 

Download references

Authors

Editor information

Dexter Kozen

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lamport, L., Owicki, S. (1982). Program logics and program verification. In: Kozen, D. (eds) Logics of Programs. Logic of Programs 1981. Lecture Notes in Computer Science, vol 131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025784

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11212-9

  • Online ISBN: 978-3-540-39047-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics