Abstract
In this paper we investigate the strong verification of programs using both inductive assertions which involve probability distributions of program variables [4] and the concept of predicate transformer [2]. 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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
Dijkstra, E. W., "A discipline of programming," Prentice-Hall, Englewood Cliffs, New Jersey, 1976.
Owicki, S. and Gries, D., "An axiomatic proof technique for parallel programs I," Acta Informatia, Vol. 6, pp. 319–340, 1976.
Wegbreit, B., "Verifying program performance," JACM, Vol. 23, No. 4, pp. 691–699, Oct. 1976.
Manna, Z. and Vuillemin, J., "Fixpoint approach to the theory of computation," CACM, Vol. 15, pp. 528–536, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ng, P.A., Bang, S.Y. (1977). Another approach for proving program correctness. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_162
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_162
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive