论文信息 - Is Sometimes Ever Better Than Always?

Is Sometimes Ever Better Than Always?

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.

David Gries | D. Gries

[1] David Gries. The Schorr-Waite Graph Marking Algorithm , 1978, Program Construction.

[2] David Gries. An exercise in proving parallel programs correct , 1977, CACM.

[3] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .

[4] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .

[5] MannaZohar,et al. Is sometime sometimes better than always , 1978 .

[6] Rod M. Burstall,et al. Program Proving as Hand Simulation with a Little Induction , 1974, IFIP Congress.

[7] Zohar Manna,et al. Is “sometime” sometimes better than “always”?: Intermittent assertions in proving program correctness , 1976, ICSE '76.

[8] Donald E. Knuth,et al. The Art of Computer Programming, Vol. 2 , 1981 .