Tony Hoare

Source: Wikipedia, the free encyclopedia.

Tony Hoare
Tony Hoare in 2011
Pronunciation
Born
Charles Antony Richard Hoare

(1934-01-11) 11 January 1934 (age 90)
Other namesC. A. R. Hoare
Education
Known for
Spouse (2023)
Scientific career
FieldsComputer science
Institutions
Doctoral students
Websitewww.cs.ox.ac.uk/people/tony.hoare

Sir Charles Antony Richard Hoare (Tony Hoare or C. A. R. Hoare)/hɔːr/

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.

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] Since 1977, he has held positions at the University of Oxford and Microsoft Research in Cambridge.

Education and early life

Tony Hoare was born in

Classics and Philosophy ("Greats") at Merton College, Oxford.[14] On graduating in 1956 he did 18 months National Service in the Royal Navy,[14] where he learned Russian.[15] He returned to the University of Oxford in 1958 to study for a postgraduate certificate in statistics,[14] and it was here that he began computer programming, having been taught Autocode on the Ferranti Mercury by Leslie Fox.[16] He then went to Moscow State University as a British Council exchange student,[14] where he studied machine translation under Andrey Kolmogorov.[15]

Research and career

In 1960, Hoare left the Soviet Union and began working at Elliott Brothers Ltd,[14] a small computer manufacturing firm located in London. There, he implemented the language ALGOL 60 and began developing major algorithms.[17][18]

He was involved with developing international standards in programming and informatics, as a member of the International Federation for Information Processing (IFIP) Working Group 2.1 on Algorithmic Languages and Calculi,[19] which specified, maintains, and supports the languages ALGOL 60 and ALGOL 68.[20]

He became the Professor of

Christopher Strachey Professor of Computing on its establishment in 1988 until his retirement at Oxford in 2000.[21] He is now an Emeritus Professor there, and is also a principal researcher at Microsoft Research in Cambridge, England.[22][23][24]

Hoare's most significant work has been in the following areas: his sorting and selection algorithm (

concurrent processes (and implemented in various programming languages such as occam), structuring computer operating systems using the monitor concept, and the axiomatic specification of programming languages.[25][26]

Speaking at a software conference in 2009, Tony Hoare hyperbolically apologized for "inventing" the null reference:[27] [28]

I call it my billion-dollar mistake. It was the invention of the null reference in 1965. At that time, I was designing the first comprehensive type system for references in an object oriented language (ALGOL W). My goal was to ensure that all use of references should be absolutely safe, with checking performed automatically by the compiler. But I couldn't resist the temptation to put in a null reference, simply because it was so easy to implement. This has led to innumerable errors, vulnerabilities, and system crashes, which have probably caused a billion dollars of pain and damage in the last forty years.[29]

For many years under his leadership, Hoare's Oxford department worked on formal specification languages such as CSP and Z. These did not achieve the expected take-up by industry, and in 1995 Hoare was led to reflect upon the original assumptions:[30]

Ten years ago, researchers into formal methods (and I was the most mistaken among them) predicted that the programming world would embrace with gratitude every assistance promised by formalisation to solve the problems of reliability that arise when programs get large and more safety-critical. Programs have now got very large and very critical – well beyond the scale which can be comfortably tackled by formal methods. There have been many problems and failures, but these have nearly always been attributable to inadequate analysis of requirements or inadequate management control. It has turned out that the world just does not suffer significantly from the kind of problem that our research was originally intended to solve.

Awards and honours

Personal life

In 1962, Hoare married Jill Pym, a member of his research team.[45]

Books

  • OCLC 23937947
    .
  • C. A. R. Hoare (1985).
    ISBN 978-0131532892 (paperback). (Available online at http://www.usingcsp.com/
    in PDF format.)
  • Hoare, C. A. R. (1989). C. B., Jones (ed.). Essays in computing science. Prentice Hall International Series in Computer Science. .
  • Hoare, C. A. R.; .
  • Hoare, C. A. R.; .

References

  1. ^ a b Tony Hoare at the Mathematics Genealogy Project
  2. ]
  3. ^ a b c "List of Fellows". Archived from the original on 8 June 2016. Retrieved 17 October 2014.
  4. ^ "Birthdays Jan 10". The Times. London. 10 January 2009. Retrieved 9 January 2010.
  5. S2CID 238251696
    .
  6. ^ "Sir Antony Hoare". Computer History Museum. Archived from the original on 3 April 2015. Retrieved 22 April 2015.
  7. ^ Tony Hoare author profile page at the ACM Digital Library
  8. ^ C. A. R. Hoare at DBLP Bibliography Server Edit this at Wikidata
  9. Microsoft Academic
  10. S2CID 1868477
    .
  11. .
  12. ^ Bowen, Jonathan (8 September 2006). Oral History of Sir Antony Hoare. Hoare (Sir Antony, C.A.R.) Oral History, CHM Reference number: X3698.2007 (Report). Computer History Museum. Archived from the original on 3 July 2013. Retrieved 18 April 2014.{{cite report}}: CS1 maint: bot: original URL status unknown (link)
  13. ^ Lean, Thomas (2011). "Professor Sir Tony Hoare" (PDF). National Life Stories: An Oral History of British Science. UK: British Library. Archived (PDF) from the original on 15 September 2014. Retrieved 15 September 2014.
  14. ^ a b c d e Levens, R.G.C., ed. (1964). Merton College Register 1900-1964. Oxford: Basil Blackwell. p. 434.
  15. ^
    ISSN 0958-7403
    . Retrieved 27 May 2014.
  16. (PDF) from the original on 9 October 2022.
  17. ^ .
  18. .
  19. ^ Jeuring, Johan; Meertens, Lambert; Guttmann, Walter (17 August 2016). "Profile of IFIP Working Group 2.1". Foswiki. Retrieved 7 October 2020.
  20. ^ Swierstra, Doaitse; Gibbons, Jeremy; Meertens, Lambert (2 March 2011). "ScopeEtc: IFIP21: Foswiki". Foswiki. Retrieved 7 October 2020.
  21. ^ "Christopher Strachey Professorship of Computing". Department of Computer Science, University of Oxford. 5 November 2021. Retrieved 18 January 2024.
  22. ^ Microsoft home page – short biography
  23. Charles Babbage Institute
    , University of Minnesota, Minneapolis.
  24. ^ The classic article on monitors – The original article on monitors
  25. ^ "Preface to the ACM Turing Award lecture" (PDF). Archived from the original (PDF) on 19 April 2012.
  26. ^ "C. Antony (Tony) R. Hoare". Archived from the original on 1 July 2012.
  27. ^ Hoare, Tony (25 August 2009). "Null References: The Billion Dollar Mistake". InfoQ.com.
  28. ^ "Null: The Billion Dollar Mistake". hashnode.com. 3 September 2020.
  29. ^ Hoare, Tony (2009). "Null References: The Billion Dollar Mistake" (Presentation abstract). QCon London. Archived from the original on 28 June 2009.
  30. .
  31. ^ "ACM Programming Systems and Languages Paper Award". Association for Computing Machinery. 1973. Retrieved 7 July 2022.
  32. S2CID 34414224
    .
  33. ^ Hoare, Charles Anthony Richard (27 October 1980). "The Emperor's Old Clothes: The 1980 ACM Turing Award Lecture" (PDF). Association for Computing Machinery. Archived from the original (PDF) on 19 April 2012.
  34. ^ Anon (1982). "Anthony Hoare FRS". royalsociety.org. London: Royal Society.
  35. ^ "Honorary Graduates 1989 to present". bath.ac.uk. University of Bath. Archived from the original on 17 July 2010. Retrieved 18 February 2012.
  36. ^ "(Charles) Antony Richard (Tony) Hoare Biography". Archived from the original on 17 July 2014.
  37. ^ "Sir Antony Hoare: 2006 Fellow". Archived from the original on 3 April 2015. Retrieved 8 March 2020."Sir Antony Hoare | Computer History Museum". Archived from the original on 3 April 2015. Retrieved 22 April 2015.
  38. ^ "Annual Review 2007: Principal's Review". www1.hw.ac.uk. Archived from the original on 5 March 2016. Retrieved 29 March 2016.
  39. ^ "Preisverleihung auf der Festveranstaltung "40 Jahre Informatik in München": TU München vergibt Friedrich L. Bauer-Preis an Tony Hoare" (in German). Technical University of Munich. 26 October 2007. Archived from the original on 10 June 2016. Retrieved 14 May 2016.
  40. ^ "Programming Languages Achievement Award 2011". ACM. Retrieved 28 August 2012.
  41. ^ "IEEE John von Neumann Medal Recipients" (PDF). IEEE. Archived (PDF) from the original on 9 October 2022. Retrieved 26 February 2011.
  42. ^ Krzysztof, Diks (15 November 2012). "Profesor Hoare doktorem honoris causa Uniwersytetu Warszawskiego" (in Polish). University of Warsaw. Archived from the original on 26 August 2014. Retrieved 26 November 2012.
  43. ^ "Los informáticos Tony Hoare y Mateo Valero serán investidos hoy doctores honoris causa por la Complutense" (in Spanish). 10 May 2013. Retrieved 10 May 2013.
  44. ^ Royal Medal 2023
  45. .

 This article incorporates text available under the CC BY 4.0 license.

External links