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

Stephen A. Cook: relative completeness of Hoare logic (1978) and the 1975 assertion language it rests on, plus proving assertions about data-structure programs and his 1971 complexity paper.

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