Skip to main content
Log in

Program proving: Jumps and functions

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Proof methods adequate for a wide range of computer programs have been expounded in [1] and [2]. This paper develops a method suitable for programs containing functions, and a certain kind Of jump. The method is illustrated by the proof of a useful and efficient program for table lookup by logarithmic search.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Hoare, C. A. R.: An axiomatic basis for computer programming. Comm. ACM 12, No. 10, 576–580 (October 1969).

    Google Scholar 

  2. — Procedures and parameters; an axiomatic approach, Symposium on the Semantics of Algorithmic Languages (ed. E. Engeler). Berlin-Heidelberg-New York: Springer 1971.

    Google Scholar 

  3. Dijkstra, E. W.: Go to statement considered harmful. Letter to the editor. Comm. ACM 11, No. 3, 147–148 (March 1968).

    Google Scholar 

  4. Knuth, D. E., Floyd, R.W.: Notes on avoiding “go to” statements. Technical Report No. CS 148, Computer Science Dept., Stanford, Jan. 1970.

    Google Scholar 

  5. Landin, P. J.: A correspondence between ALGOL 60 and Church's lambda notation, parts I and II. Comm. ACM 8, Nos. 2 and 3, 89–101, Feb., 158–165, Mar. (1965).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Clint, M., Hoare, C.A.R. Program proving: Jumps and functions. Acta Informatica 1, 214–224 (1972). https://doi.org/10.1007/BF00288686

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00288686

Keywords

Navigation