C. A. R. Hoare

9 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.

C. A. R. Hoare

Program correctness, from algorithms published as code (Find and Quicksort, 1961-62) to the axiomatic basis for proving what a program does without running it (1969) and its application back to those same algorithms in 1971. The other strand is what a program may touch or share: procedures and parameters on aliasing, and monitors and communicating sequential processes on concurrency. The corpus also holds his later doubt about the necessity of proof, 'How did software get so reliable without proof?' (1996), so the set is an argument rather than a reputation. dblp: https://dblp.org/pid/h/CARHoare

How did software get so reliable without proof?

C. A. R. Hoare (1996) · 3rd International Symposium of Formal Methods Europe (FME) · Springer

Communicating sequential processes

C. A. R. Hoare (1978) · Communications of the ACM · Association for Computing Machinery

Monitors: an operating system structuring concept

C. A. R. Hoare (1974) · Communications of the ACM · Association for Computing Machinery

Proof of a Recursive Program: Quicksort

M. Foley and others (1971) · The Computer Journal

Procedures and parameters: An axiomatic approach

C. A. R. Hoare (1971) · Symposium on Semantics of Algorithmic Languages

Proof of a Program: FIND

C. A. R. Hoare (1971) · Communications of the ACM · Association for Computing Machinery

An axiomatic basis for computer programming

C. A. R. Hoare (1969) · Communications of the ACM · Association for Computing Machinery

Quicksort

C. A. R. Hoare (1962) · The Computer Journal

Algorithm 65: find

C. A. R. Hoare (1961) · Communications of the ACM · Association for Computing Machinery