Is Sometimes Ever Better Than Always?

Authors:
David Gries
Affiliations:
Computer Science Department, Upson Hall, Cornell University, Ithaca, NY
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1979

Citing 4
Cited 5

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Is “sometime” sometimes better than “always”?: intermittent assertions in proving program correctness

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
A Discipline of Programming

A Discipline of Programming

Generalizing specifications for uniformly implemented loops

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Weaker Precondition for Loops

ACM Transactions on Programming Languages and Systems (TOPLAS)
A case for teaching program verification: Its importance in the CS curriculum

SIGCSE '83 Proceedings of the fourteenth SIGCSE technical symposium on Computer science education
A system for classifying program verification methods: Assigning meanings to program verification methods

ICSE '84 Proceedings of the 7th international conference on Software engineering
The hydra battle revisited

Rewriting Computation and Proof

Quantified Score

Hi-index	0.00

Visualization

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.