Automatic construction of verification condition generators from hoare logics

  • Mark Moriconi
  • Richard L. Schwartz
Session 12: A.R. Meyer, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)


We define a method for mechanically constructing verification condition generators from a useful class of Hoare logics. Any verification condition generator constructed by our method is shown to be sound and deduction-complete with respect to the associated Hoare logic. The method has been implemented.


Normal Form Inference Rule Axiom System Predicate Symbol Monotonicity Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    E.M. Clarke, Jr. Programming language constructs for which it is impossible to obtain good Hoare axiom systems. Journal of the ACM, 26,1, pp. 129–147, January 1979.Google Scholar
  2. 2.
    S.A. Cook. Soundness and completeness of an axiom system for program verification. SIAM Journal of Computing, Vol. 7, No. 1, pp. 70–90, February 1978.Google Scholar
  3. 3.
    E.W. Dijkstra. A discipline of programming. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1976.Google Scholar
  4. 4.
    C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, vol. 12, no. 10, pp. 576–580, October 1969.Google Scholar
  5. 5.
    C.A.R. Hoare and N. Wirth. An axiomatic definition of the programming language Pascal. Acta Informatica, 2, 4, pp. 335–355, 1973.Google Scholar
  6. 6.
    S. Igarashi, R.L. London, D.C. Luckham. Automatic program verification I: A logical basis and its implementation. Acta Informatica, 4, pp. 145–182, 1975.Google Scholar
  7. 7.
    R.L. London, J.V. Guttag, J.J. Horning, B.W. Lampson, J.G. Mitchell, and G.J. Popek. Proof rules for the programming language Euclid. Acta Informatica, 10, pp. 1–26, 1978.Google Scholar
  8. 8.
    A. Meyer and J. Halpern. Axiomatic definitions of programming languages: a theoretical assessment. Seventh Annual ACM Symposium on Principles of Programming Languages, pp. 203–212, January 1980.Google Scholar
  9. 9.
    R. Schwartz. An axiomatic semantic definition of Algol 68. Ph.D. thesis, UCLA Computer Science Department Report UCLA-34-P214-75, August 1978.Google Scholar
  10. 10.
    R. Schwartz. An Axiomatic Treatment of Algol 68 Routines. Proceedings of the International Conference on Automata, Languages and Programming, Springer Verlag Lecture Notes in Computer Science, July 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Mark Moriconi
    • 1
  • Richard L. Schwartz
    • 1
  1. 1.Computer Science LaboratorySRI InternationalMenlo Park

Personalised recommendations