Skip to main content
SpringerLink
Log in

Computer Programs can be Proved Correct

  • Conference paper
Theoretical Approaches to Non-Numerical Problem Solving

Part of the book series: Lecture Notes in Operations Research and Mathematical Systems ((LNE,volume 28))

Abstract

There has been much recent interest in proving the semantic correctness of computer programs, that is, in showing that computer programs meet their specifications or have certain desirable properties. The work of Burstall (1969), Cooper (1967), Floyd (1967), McCarthy (1963), McCarthy and Painter (1967) and Naur (1966) can be cited to demonstrate this interest. Moreover, it is now recognized that a program or algorithm ought to be accompanied by a proof of correctness. Even though this proof is seldom given, at least the need for such proof is recognized.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrahams, P.W., Machine verification of mathematical proof. Sc. D. thesis, Massachusetts Institute of Technology, 1963

    Google Scholar 

  2. Burstall, R.M., Proving properties of programs by structural induction. Computer Journal, (to appear) 1969

    Google Scholar 

  3. Burstall, R.M. and Landin, P.J., Programs and their proofs: an algebraic approach, in Machine Intelligence 4, Meltzer, B. and Michie, D. (eds.), Edinburgh University Press, (to appear) 1969

    Google Scholar 

  4. Cooper, D.C., Mathematical proofs about computer programs, in Machine Intelligence 1, Collins, N.L. and Michie, D. (eds.), American Elsevier, New York, 1967, pp. 17–28

    Google Scholar 

  5. Evans, A. Jr., Syntax analysis by a production language. Ph.D. thesis, Carnegie-Mellon University, 1965

    Google Scholar 

  6. Floyd, R.W., Assigning meanings to programs, in Proceedings of a Symposium in Applied Mathematics, Vol. 19 - Mathematical Aspects of Computer Science, Schwarcz, J.T. (ed.), American Mathematical Society, Providence, R.I., 1967, pp. 19–32

    Google Scholar 

  7. Good, D.I. and London, R.L., Interval arithmetic for the Burroughs B5500: Four Algol procedures and proofs of their correctness”! Computer Science Technical Report No. 26, University of Wisconsin, 1968

    Google Scholar 

  8. Iverson, K.E., A Programming Language. John Wiley and Sons, New York, 1962

    MATH  Google Scholar 

  9. Kaplan, P.M., Correctness of a compiler for Algol-like programs. Artificial Intelligence Memo. No. 48, Stanford University, 1967

    Google Scholar 

  10. Knuth, D.E., The Art of Computer Programming, Vol. 1 - Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968, section 1.2.1

    MATH  Google Scholar 

  11. London, R.L. and Wasserman, A.I., The anatomy of an Algol procedure. Computer Sciences Technical Report No. 5, University of Wisconsin, 1967

    Google Scholar 

  12. London, R.L., Correctness of the Algol procedure ASKFQRHAND. Computer Sciences Technical Report No. 50, University of Wisconsin, 1968

    Google Scholar 

  13. McCarthy, J., Towards a mathematical science of computation, in Information Processing 1962 - Proceedings of IFIP Congress 62, Poppelwell, CM. (ed.), North-Holland, Amsterdam, 1963, pp. 21–28

    Google Scholar 

  14. McCarthy, J. and Painter, J.A., Correctness of a compiler for arithmetic expressions, in Proceedings of a Symposium in Applied Mathematics, Vol. 19 - Mathematical Aspects of Computer Science, Schwarcz, J.T. (ed.), American Mathematical Society, Providence, Rhode Island, 1967, pp. 33–41

    Google Scholar 

  15. Moore, R.E., Interval Analysis. Prentice-Hall, Englewood Cliffs, N.J., 1966

    MATH  Google Scholar 

  16. Naur P Proof of algorithms by general snapshots. BIT, Vol. 6, No. 4, 1966, pp. 310–316

    Google Scholar 

  17. Painter, J.A., Semantic correctness of a compiler for an Algol-like language. Artificial Intelligence Memo No. 44, Stanford University, 1967

    Google Scholar 

  18. Tobey, R.G., Rational function integration. Ph.D. thesis, Harvard University, 1967

    Google Scholar 

  19. Tobey, R.G., Personal communication. 1968

    Google Scholar 

  20. Wasserman, A.I., Bridge bidding by computer. Unpublished research, University of Wisconsin, undated

    Google Scholar 

  21. Yohe, J.M., Computer programming for accuracy. Mathematics Research Center Technical Summary Report No. 866, University of Wisconsin, 1968

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, USA

    Ralph L. London

Authors
  1. Ralph L. London
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Systems Research Center, Case Western Reserve University, Cleveland, Ohio, USA

    R. B. Banerji  & M. D. Mesarovic  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1970 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

London, R.L. (1970). Computer Programs can be Proved Correct. In: Banerji, R.B., Mesarovic, M.D. (eds) Theoretical Approaches to Non-Numerical Problem Solving. Lecture Notes in Operations Research and Mathematical Systems, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-99976-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-99976-5_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04900-5

  • Online ISBN: 978-3-642-99976-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation