Acta Informatica

, Volume 1, Issue 3, pp 214–224 | Cite as

Program proving: Jumps and functions

  • M. Clint
  • C. A. R. Hoare


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.


Information System Operating System Data Structure Computer Program Communication Network 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hoare, C. A. R.: An axiomatic basis for computer programming. Comm. ACM 12, No. 10, 576–580 (October 1969).Google Scholar
  2. 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. 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. 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. 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

Copyright information

© Springer-Verlag 1972

Authors and Affiliations

  • M. Clint
    • 1
  • C. A. R. Hoare
    • 2
  1. 1.Department of MathematicsNew University of Ulster Coleraine, Co.LondonderryNorthern Ireland
  2. 2.Department of Computer ScienceThe Queen's University of BelfastBelfastNorthern Ireland

Personalised recommendations