Proving Theorems about LISP Functions
Journal of the ACM (JACM)
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Inductive assertion patters for recursive procedures
Programming Symposium, Proceedings Colloque sur la Programmation
Verifying programs by algebraic and logical reduction
Proceedings of the international conference on Reliable software
A view of program verification
Proceedings of the international conference on Reliable software
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
Journal of the ACM (JACM)
Proving the correctness of coroutines without history variables
ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
A complete axiomatic system for proving deductions about recursive programs
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On the theory of programming logics
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
A structure A is presented for which Hoare's formal system for partial correctness is incomplete, even if the entire first-order theory of A is included among the axioms. It follows that the language of first-order logic is insufficient to express all loop invariants. The implications of this result for program-proving are discussed.