Another approach for proving program correctness

  • Peter A. Ng
  • Sung Y. Bang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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. 2.
    Dijkstra, E. W., "A discipline of programming," Prentice-Hall, Englewood Cliffs, New Jersey, 1976.Google Scholar
  3. 3.
    Owicki, S. and Gries, D., "An axiomatic proof technique for parallel programs I," Acta Informatia, Vol. 6, pp. 319–340, 1976.CrossRefGoogle Scholar
  4. 4.
    Wegbreit, B., "Verifying program performance," JACM, Vol. 23, No. 4, pp. 691–699, Oct. 1976.CrossRefGoogle Scholar
  5. 5.
    Manna, Z. and Vuillemin, J., "Fixpoint approach to the theory of computation," CACM, Vol. 15, pp. 528–536, 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Peter A. Ng
    • 1
  • Sung Y. Bang
    • 2
  1. 1.Department of Computer ScienceUniversity of Missouri-ColumbiaColumbia
  2. 2.Michigan Bell TelephoneSouthfield

Personalised recommendations