Abstract
The role of Temporal Logic as a feasible approach to the specification and verification of concurrent systems is now widely accepted. A companion paper in this volume ([HP]) defines more precisely the area of applicability of Temporal Logic as that of reactive systems.
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
Barringer, H., Kuiper, R. — A Temporal Logic Specification Method Supporting Hierarchical Development, University of Manchester (November 1983).
Barringer, H., Kuiper, R., Pnueli, A. — Now You May Compose Temporal Logic Specifications, Proc. of the 16th ACM Symposium on Theory of Computing (1984) 51–63.
Barringer, H., Kuiper, R., Pnueli, A. — A Compositional Temporal Approach to a CSP-like Language, Proc. of IFIP Conference, The Role of Abstract Models in Information Processing.
Frances, N., Pnueli, A. — A Proof Method for Cyclic Programs, Acta Informatica 9 (1978) 133–157.
Gabbay, D., Pnueli, A., Shelah, S., Stavi, J. — On the Temporal Analysis of Fairness, Proc. of the 7th ACM Symposium on Principles of Programming Languages (1980) 163–173.
Gerth, R. — Transition Logic, Proc. of the 16th ACM Symposium on Theory of Computing (1984) 39–50.
Hailpern, B., Owicki, S. — Modular Verification of Computer Communication Protocols, IEEE Trans. on Communications, COM-31, 1 (Jan. 1983) 56–68.
Harel, D., Pnueli, A. — On the Development of Reactive Systems, Thisissue.
Koymans, R., Vytopil, J., De Roever, W.P. — Real Time Programming and Asynchronous Message Passing, 2nd ACM Symposium on Principles of Distributed Computing, Montreal (1983) 187–197.
Lamport, L. — What Good is Temporal Logic?, Proceedings IFIP (1983) 657–668.
Lamport, L. — Specifying Concurrent Program Modules, ACM TOPLAS, 5, 2 (1983) 190–222.
Lamport, L., Schneider, P. — The “Hoare Logic” of CSP and All That,ACM TOPLAS, 6, 2 (April 1984) 281–296.
Misra, J., Chandy, K.M. — Proofs of Networks of Processes, IEEE Transactions on Software Engin. SE-7, 4 (July 1981).
Manna, Z., Pnueli, A.–Verification of Concurrent Programs: The Temporal Framework, in Correctness Problem in Computer Science, R.S. Boyer, J.S. Moare (eds.) Academic Press (1982) 215–273.
Manna, Z., Pnueli, A. — Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs, Science of Computer Programming, 4,3 (1984) 257–290.
Manna, Z., Pnueli, A. — Verification of Concurrent Programs. A Temporal Proof System, Proc. 4th School on Advanced Programming, Amsterdam (June 1982) 163–255.
Manna, Z., Pnueli, A. — How to Cook a Temporal Proof System for Your Pet Language, Proceeding of the Symposium of Principles of Programming Languages (1983).
Naur, P. (Ed.) — Revised Report on the Algorithmic Language Algol 60, CACM, 6, 1 (1963) 1–17.
Owicki, S., Gries, D. — An Axiomatic Proof Technique for Parallel Programs, Acta Informatica 6 (1976) 319–340.
Owicki, S., Lamport, L. — Proving Liveness Properties of Concurrent Programs, ACM TOPLAS 4, 3 (July 1982) 455–495.
Peterson, G.L. — Myths about the Mutual Exclusion Problem, Information Processing Letters 12, 3 (1981) 115–116.
De Roever, W.P., Zwiers, J. — manuscript.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Heidelberg
About this paper
Cite this paper
Pnueli, A. (1985). In Transition From Global to Modular Temporal Reasoning about Programs. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-82453-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-82455-5
Online ISBN: 978-3-642-82453-1
eBook Packages: Springer Book Archive