Another approach for proving program correctness
In this paper we investigate the strong verification of programs using both inductive assertions which involve probability distributions of program variables  and the concept of predicate transformer . This deductive system for proving program correctness and program performance is extended to include Parallelism. Methods for proving the absence of deadlock and for predicting the occurrence of deadlock are also discussed.
Unable to display preview. Download preview PDF.
- 1.Basu, S. K. and Yeh, R. T., "Strong verification of programs," IEEE Trans. Software Engineering, Vol. SE-1, No. 3, pp. 339–345, Sept. 1975.Google Scholar
- 2.Dijkstra, E. W., "A discipline of programming," Prentice-Hall, Englewood Cliffs, New Jersey, 1976.Google Scholar
- 5.Manna, Z. and Vuillemin, J., "Fixpoint approach to the theory of computation," CACM, Vol. 15, pp. 528–536, 1972.Google Scholar