Sir Tony Hoare | |
---|---|
Born | Charles Antony Richard Hoare 11 January 1934 |
Education | |
Known for | |
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) Royal Medal (2023) |
Scientific career | |
Fields | Computer science |
Institutions | |
Doctoral students | |
Website | www |
Sir Charles Antony Richard Hoare (/hɔːr/; born 11 January 1934), also known as C. A. R. Hoare, is a British computer scientist who has made foundational contributions to programming languages, algorithms, operating systems, formal verification, and concurrent computing.[3] His work earned him the Turing Award, usually regarded as the highest distinction in computer science, in 1980.
Hoare developed the sorting algorithm quicksort in 1959–1960.[4] 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.[5][6][7][8][9][10] Since 1977, he has held positions at the University of Oxford and Microsoft Research in Cambridge.
{{cite report}}
: CS1 maint: bot: original URL status unknown (link)