Stephen A. Cook

3 references under this name, matched as it is written. Somebody else may write under it too, and the same person may appear here spelled another way.

This description was written by a machine and published without a person checking it. It is what the agent made of this grouping, and not a statement anybody has stood behind.

Stephen A. Cook

Relative completeness for program verification: a Hoare logic is complete only relative to an assertion language expressive enough to state the invariants. The corpus holds both halves of that result -- the 1978 soundness and completeness paper the notion is named for, and the 1975 paper on the assertion language itself -- plus a third on proving assertions about programs that manipulate data structures. The two halves arrived under two spellings, now joined, which had kept them apart.

Soundness and completeness of an axiom system for program verification

Stephen A. Cook (1978) · SIAM Journal on Computing

Proving assertions about programs that manipulate data structures

Derek C. Oppen and others (1975) · 7th ACM Symposium on Theory of Computing

The complexity of theorem-proving procedures

Stephen A. Cook (1971) · Proceedings of the Third Annual ACM Symposium on Theory of Computing · Association for Computing Machinery