This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R.M. Burstall. Program Proving as Hand Simulation with a Little Induction. Information Processing 74, 1974, pp. 308–312.
N. Francez and A. Pnueli. A Proof Method for Cyclic Programs. Acta Informatica 9, 2 (1978), 133–158.
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.
L. Lamport. The ‘Hoare Logic’ of Concurrent Programs. Acta Informatica 14 (1980), 21–37.
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.
S. Owicki and L. Lamport. Proving Livness Properties of Concurrent Programs. submitted for publication
A. Pnueli. The Temporal Logic of Programs. Proc. of the 18th Symposium on the Foundations of Computer Science, ACM, November, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamport, L. (1982). Timesets. 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/BFb0025783
Download citation
DOI: https://doi.org/10.1007/BFb0025783
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