Program proving: Jumps and functions
暂无分享，去创建一个
SummaryProof 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.
[1] P. J. Landin,et al. Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.
[2] Edsger W. Dijkstra,et al. Letters to the editor: go to statement considered harmful , 1968, CACM.
[3] Robert W. Floyd,et al. Notes on Avoiding "go to" Statements , 1971, Information Processing Letters.
[4] C. A. R. HOARE,et al. An axiomatic basis for computer programming , 1969, CACM.