Abstract
A large body of research on the logic of concurrent programs may be characterized as the “axiomatic” school. Members of this school reason about safety properties (“something bad never happens”) in terms of invariance, and liveness properties (“something good eventually does happen”) using temporal logic.
Work Supported in part by the National Science Foundation under grant number MCS-8104459 and by the Army Research Office under grant number DAAG29-83-K-0119.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Karl M. Abrahamson. Decidability and Expressiveness of Logics of Processes. Ph. D. Thesis, issued as Technical Report No. 80–08–01, Department of Computer Science, University of Washington. (August 1980).
Denotational Semantics of Concurrency. J. W. de Bakker and J. C. Zucker. Fourteenth ACM Symposium on the Theory of Computing, San Francisco, ( May, 1982 ), 153–158.
Z. C. Chen and C. A. R. Hoare. Partial Correctness of Communicating Sequential Processes. Proceedings of the Second IEEE International Conference on Distributed Computer Systems, (1981) 1–12.
L. Lamport. The “Hoare Logic” of Concurrent Programs. Acta Informatica 1.4 (1980), 21–37.
L. Lamport. “Sometime” Is Sometimes “Not Never”. Proceedings of the Seventh Annual ACM Conference on the Principles of Programming Languages, (January 1980) 174–185.
L. Lamport. Specifying Concurrent Program Modules. ACM Transactions on Prog. Logic and Sys. 5, 2 (April 1983) 190–222.
L. Lamport. Reasoning About Nonatornic Operations. Proceedings of the Tenth Annual ACM Conference on the Principles of Programming Languages, (January 1983) 28–37.
L. Lamport. What Good Is Temporal Logic? Information Processing 83, R. E. Mason (ed.), Elsevier Science Publishers, North Holland (1983), 657–668.
L. Lamport and F. B. Schneider. The Hoare Logic of CSP and All That. ACM Transactions on Prog. Logic and Sys. 6, 2 (April 1984) 281–296.
L. Lamport and F. B. Schneider. Constraints: A Uniform Approach to Aliasing and Typing. To appear in Proceedings of the Twelfth Annual ACM Conference on the Principles of Programming Languages, (January 1985).
R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science, Number 92. Springer-Verlag, Berlin (1980).
S. S. Owicki and L. Lamport. Proving Liveness Properties of Concurrent Programs. ACM Trans. on Prog. Lang. and Systems 4, 3 (1982), 455–495.
A. Pnueli. The Temporal Logic of Programs Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (1977), Providence Rhode Island.
H. Barringer, R. Kuiper. and A. Pnueli. Now You May Compose Temporal Logic Specifications. Sixteenth ACM Symposium on the Theory of Computing, (May, 1984 ).
J. Sifakis. A Unified Approach for Studying the Properties of Transition Systems. Theoretical Computer Science 18 (1982), 227–258.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lamport, L. (1985). An Axiomatic Semantics of Concurrent Programming Languages. In: Apt, K.R. (eds) Logics and Models of Concurrent Systems. NATO ASI Series, vol 13. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82453-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-82453-1_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82455-5
Online ISBN: 978-3-642-82453-1
eBook Packages: Springer Book Archive