Tony Hoare

Sir Charles Antony Richard Hoare (Tony Hoare or C. A. R. Hoare) FRS FREng[3] (born 11 January 1934)[4] is a British computer scientist who has made foundational contributions to programming languages, algorithms, operating systems, formal verification, and concurrent computing.[5] His work earned him the Turing Award, usually regarded as the highest distinction in computer science, in 1980.

Quick facts: Sir Tony Hoare FRS FREng, Born, Other na... ▼

Sir Tony Hoare FRS FREng
Tony Hoare in 2011
Born	Charles Antony Richard Hoare (1934-01-11) 11 January 1934 (age 89) Colombo, British Ceylon
Other names	C. A. R. Hoare
Education	University of Oxford (BA) Moscow State University
Known for	Quicksort Quickselect Hoare logic Null reference Communicating sequential processes Structured programming ALGOL
Spouse	Jill Pym
Children	3
Awards	Turing Award (1980) Harry H. Goode Memorial Award (1981) Faraday Medal (1985) Computer Pioneer Award (1990) Kyoto Prize (2000) IEEE John von Neumann Medal (2011)
Scientific career
Fields	Computer science
Institutions	Elliott Brothers Queen's University Belfast University of Oxford Moscow State University Microsoft Research
Doctoral students	Cliff Jones[1] Bill Roscoe[1] Augusto Sampaio[2]
Website	www.cs.ox.ac.uk/people/tony.hoare

Hoare developed the sorting algorithm quicksort in 1959–1960.[6] He developed Hoare logic, an axiomatic basis for verifying program correctness. In the semantics of concurrency, he introduced the formal language communicating sequential processes (CSP) to specify the interactions of concurrent processes, and along with Edsger Dijkstra, formulated the dining philosophers problem.[7][8][9][10][11][12] He is also credited with development (and later criticism) of the null pointer, having introduced it in the ALGOL family of languages. Since 1977, he has held positions at the University of Oxford and Microsoft Research in Cambridge.