An axiomatization of the intermittent assertion method using temporal logic
- 100 Downloads
The intermittent assertion method proposed by Burstall [B] and subsequently popularized by Manna and Waldinger [MW] is axiomatized using a fragment of temporal logic. The proposed proof system allows to reason about while-programs. The proof system is proved to be arithmetically sound and complete in the sense of Harel [H]. The results of the paper generalize a corresponding result of Pnueli
The system decomposes into two parts. The first part allows to prove liveness properties using as axioms theorems of the second part allowing to prove simple safety properties.
The completeness proof is constructive and provides a heuristic for proving specific limeness formulas.
Unable to display preview. Download preview PDF.
- [A]Apt, K.R., Ten Years of Hoare's logic, a survey, part I, TOPLAS, vol. 3,4, pp. 431–483, 1981.Google Scholar
- [B]Burstall, R.M., Program proving as hand simulation with a little induction, in: Proceedings IFIP 74, pp. 308–312, North Holland, Amsterdam, 1974.Google Scholar
- [H]Harel, D., First order dynamic logic, Lecture Notes in Computer Science, 68, Springer Verlag, 1979.Google Scholar
- [HP]Hennessy, M.C.B., Plotkin G.D., Full abstraction for a simple programming language, in: Proceedings 8th Symposium MFCS, Lecture Notes in Computer Science, 74, pp. 108–120, 1979.Google Scholar
- [Ho]Hoare, C.A.R., An axiomatic basis of computer programming, Communications ACM, vol. 12, 10, pp. 576–580, 583, 1969.Google Scholar
- [L]Lamport, L., The “Hoare Logic” of concurrent programs, Acta Informatica, vol. 14, 1, pp. 21–37, 1980.Google Scholar
- [MP1]Manna Z., Pnueli A., Verification of concurrent programs; The temporal framework, in: The Correctness Problem in Computer Science, International Lecture Series in Computer Science, Academic Press, London, 1981.Google Scholar
- [MP2]Manna Z., Pnueli A., Verification of concurrent programs; Temporal proof principles, in: Logic of Programs, Lecture Notes in Computer Science, 131, pp. 200–252, 1982.Google Scholar
- [MW]Manna Z., Waldinger R., Is “Sometime” sometimes better than “Always” ?, Communications ACM, vol. 21, 2, pp. 159–172, 1978.Google Scholar
- [OL]Owicki S., Lamport L., Proving liveness properties of concurrent programs, TOPLAS, vol. 4, 3, pp. 455–495, 1982.Google Scholar
- [P]Pnueli, A., The temporal logic of programs, in: Proceedings 18th Symposium FOCS, pp. 46–57, IEEE, Providence, R.l., 1977.Google Scholar