Abstract
The paper explores the three important classes of temporal properties of concurrent programs: invariance, liveness and precedence. It presents the first methodological approach to the precedence properties, while providing a review of the invariance and liveness properties. The approach is based on the unless operator \(\mathfrak{A}\), which is a weak version of the until operator U. For each class of properties, we present a single complete proof principle.
This research was supported in part by the National Science Foundation under grants MCS79-09495 and MCS80-06930, by DARPA under Contract N00039-82-C-0250, by the United States Air Force Office of Scientific Research under Grant AFOSR-81-0014, and by the Basic Research Foundation of the Israeli Academy of Sciences.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Keller, R.M., “Formal verification of parallel programs,” CACM, Vol. 19, No. 7 (July 1976), pp. 371–384.
Lamport, L., “Proving the Correctness of Multiprocess Programs,” IEEE Trans. Soft. Eng. SE-3, 2 (Mar. 1977), pp. 125–143.
Lamport, L., “ 'sometime ‘is Sometimes ‘Not Never': On the Temporal Logic of Programs,” 7th Annual ACM Symposium on Principles of Programming Languages (1980), pp. 174–185.
Lehmann, D., A. Pnueli, and J. Stavi, “Impartiality, justice and fairness: the ethics of concurrent termination,” in Automata Languages and Programming, Lecture Notes in Computer Science 115, Springer Verlag (1981), pp. 264–277.
Manna, Z. and A. Pnueli, “Verification of Concurrent Prorams: The Temporal Framework,” in The Correctness Problem in Computer Science (R.S. Boyer and J S. Moore, eds.), International Lecture Series in Computer Science, Academic Press, London (1982), pp. 215–273.
Manna, Z. and A. Pnueli, “Verification of Concurrent Programs: Temporal Proof Principles,” Proc. of the Workshop on Logic of Programs (D. Kozen, ed.), Yorktown-Heights, N.Y. (1981). Springer-Verlag Lecture Notes in Computer Science 131, pp. 200–252.
Manna, Z. and A. Pnueli, “Verification of Concurrent Programs: Proving Eventualities by Well-Founded Ranking,” TOPLAS (1983, to appear).
Manna, Z. and A. Pnueli, “Verification of Concurrent Programs: a Temporal Proof System,” Proc. 4th School on Advanced Programming, Amsterdam, Holland (June 1982).
Manna, Z. and A. Pnueli, “How to Cook a Temporal Proof System for Your Pet Language,” in the Proc. of the Symposium on Principles of Programming Languages, Austin, Texas (Jan. 1983).
Manna, Z. and A. Pnueli, “Proving Precedence Properties: The Temporal Way,” Technical Report, Computer Science Dept., Stanford University, Stanford, CA(1983, to appear).
Owicki, S. and L. Lamport, “Proving Liveness Properties of Concurrent Programs,” ACM Transactions on Programming Languages and Systems, Vol. 4, No. 3 (July 1982), pp. 455–495.
Owicki, S. and D. Gries, “An Axiomatic Proof technique for Parallel Programs,” Acta Informatica, Vol. 6, No. 4 (1976), pp. 319–340.
Peterson, G.L., “Myths about the Mutual Exclusion Problem,” Information Processing Letters, Vol. 12, No. 3 (June 1981), pp. 115–116.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manna, Z., Pnueli, A. (1983). Proving precedence properties: The temporal way. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036932
Download citation
DOI: https://doi.org/10.1007/BFb0036932
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive