Is Sometimes Ever Better Than Always?
- 1 October 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 1 (2), 258-265
- https://doi.org/10.1145/357073.357080
Abstract
The “intermittent assertion” method for proving programs correct is explained and compared with the conventional method. Simple conventional proofs of iterative algorithms that compute recursively defined functions, including Ackermann's function, are given.Keywords
This publication has 2 references indexed in Scilit:
- Is “sometime” sometimes better than “always”?Communications of the ACM, 1978
- An axiomatic basis for computer programmingCommunications of the ACM, 1969