Logic of Programs 1981: Logics of Programs pp 177-196 | Cite as


A new method for temporal reasoning about programs
  • Leslie Lamport
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 131)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R.M. Burstall. Program Proving as Hand Simulation with a Little Induction. Information Processing 74, 1974, pp. 308–312.Google Scholar
  2. 2.
    N. Francez and A. Pnueli. A Proof Method for Cyclic Programs. Acta Informatica 9, 2 (1978), 133–158.CrossRefGoogle Scholar
  3. 3.
    D. Gabbay, A. Pnueli, S. Shelah and Y. Stavi. On the Temporal Analysis of Fairness. Seventh Annual ACM Symposium on Principles of Programming Languages, ACM, Las Vegas, Nevada, January, 1980, pp. 163–173.Google Scholar
  4. 4.
    L. Lamport. The ‘Hoare Logic’ of Concurrent Programs. Acta Informatica 14 (1980), 21–37.CrossRefGoogle Scholar
  5. 5.
    L. Lamport. 'sometime’ is Sometimes ‘Not Never': A Tutorial on the Temporal Logic of Programs. Proceedings of the Seventh Annual Symposium on Principles of Programming Languages, ACM SIGACT-SIGPLAN, January, 1980.Google Scholar
  6. 6.
    S. Owicki and L. Lamport. Proving Livness Properties of Concurrent Programs. submitted for publicationGoogle Scholar
  7. 7.
    A. Pnueli. The Temporal Logic of Programs. Proc. of the 18th Symposium on the Foundations of Computer Science, ACM, November, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • Leslie Lamport
    • 1
  1. 1.Computer Science LaboratorySRI InternationalMenlo ParkUSA

Personalised recommendations