Advertisement

A more mechanical approach to program verification

  • Irene Greif
  • Richard Waldinger
Preuves Formelles De Programmes Proving Properties Of Programs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 19)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Boyer and Moore [1973]
    Boyer, R. and J. Moore, "Proving Theorems about LISP Functions," Third International Joint Conference on Artificial Intelligence. Stanford University. Stanford, California.Google Scholar
  2. Elspas [1972]
    Elspas, B., M. W. Green, K. M. Levitt, and R. J. Waldinger, "Research in Interactive Program-Proving Techniques," SRI Project 8398, Phase II, SRI, MenIo Park, Ca.Google Scholar
  3. Floyd [1967]
    Floyd, R., "Assigning Meaning to Programs," Symposium on Applied Mathematics, Vol. 19.Google Scholar
  4. Fusaoka [1974]
    unpublished draft, SRI.Google Scholar
  5. Katz and Manna [1973]
    Katz, S. and Z. Manna, "A Heuristic Approach to Program Verification," Third International Joint Conference on Artificial Intelligence. Stanford University. Stanford, California.Google Scholar
  6. Manna [1969]
    Manna, Z., "The Correctness of Programs," Journal of Computer and System Sciences, Vol. 3, No. 2.Google Scholar
  7. Wegbreit [1973]
    Wegbreit, B., "Heuristic Methods for Mechanically Deriving Inductive Assertions," Third International Joint Conference on Artificial Intelligence. Stanford University. Stanford, California.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Irene Greif
    • 1
  • Richard Waldinger
    • 2
  1. 1.Massachusetts Institute of TechnologyUSA
  2. 2.Stanford Research InstituteUSA

Personalised recommendations