Abstract
The paper presents a minimal proof theory which is adequate for proving the main important temporal properties of reactive programs. The properties we consider consist of the classes of invariance, response, and precedence properties. For each of these classes we present a small set of rules that is complete for verifying properties belonging to this class. We illustrate the application of these rules on several examples. We discuss concise presentations of complex proofs using the devices of transition tables and proof diagrams.
This research was supported in part by the National Science Foundation under grant CCR-89-11512; by the Defense Advanced Research Projects Agency under contract NAG2-703, by the United States Air Force Office of Scientific Research under contracts AFOSR-90-0057, and by the European. Community ESPRIT Basic Research Action project 6021 (React).
A preliminary and abbreviated version of this paper appeared in [MP90].
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.
Similar content being viewed by others
References
B. Alpern and F.B. Schneider. Verifying temporal properties without temporal logic. ACM Trans. Prog. Lang. Sys., 11: 147 – 167, 1989.
K.M. Chandy and J. Misra. Parallel Program Design. Addison-Wesley, 1988.
E. W. Dijkstra. Co-operating sequential processes. In Programming Languages (F. Genuys, editor), pages 43–112. Academic Press, 1965.
D. Harel. Statecharts: A visual formalism for complex systems. Sci. Comp. Prog., 8: 231 – 274, 1987.
L. Lamport. What good is temporal logic. In Proc. IFIP 9th World Congress (R.E.A. Mason, editor), pages 657 – 668. North-Holland, 1983.
Z. Manna and A. Pnueli. Proving precedence properties: The temporal way. In Proc. 10th Int. Colloq. Aut. Lang. Prog., volume 154 of Lect. Notes in Comp. Sci., pages 491–512. Springer-Verlag, 1983.
Z. Manna and A. Pnueli. Specification and verification of concurrent programs by V-automata. In Proc. 14th ACM Symp. Princ. of Prog. Lang., pages 1 – 12, 1987.
Z. Manna and A. Pnueli. The anchored version of the temporal framework. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors), pages 201–284. Lec. Notes in Comp. Sci. 354, Springer, 1989.
Z. Manna and A. Pnueli. A temporal proof methodology for reactive systems. In 5th Jerusalem Conference on Information Technology, pages 757 – 773, 1990.
Z. Manna and A. Pnueli. Completing the temporal picture. Theor. Comp. Sci., 83 (1): 97 – 130, 1991.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
G. L. Peterson. A new solution to Lamport’s concurrent programming problem. ACM Tnans. Prog. Lang. Sys., 5 (1): 56 – 65, 1983.
A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. Found. of Comp. Sci., pages 46 – 57, 1977.
B. K. Szymanski. A simple solution to Lamport’s concurrent programming problem with linear wait. In Proc. 1988 International Conference on Supercomputing Systems, pages 621 – 626, St. Malo, France, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manna, Z., Pnueli, A. (1993). A Temporal Proof Methodology for Reactive Systems. In: Broy, M. (eds) Program Design Calculi. NATO ASI Series, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-02880-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-02880-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08164-4
Online ISBN: 978-3-662-02880-3
eBook Packages: Springer Book Archive