Tony Hoare

Sir Charles Antony Richard Hoare ( born January 11, 1934 in Colombo, Sri Lanka), better known as Tony Hoare or CAR Hoare, is a British computer scientist.

Hoare gained high reputation through the development of the Quicksort algorithm and the Hoare - calculus, with which the correctness of algorithms can be proved. In addition, Hoare developed the process algebra Communicating Sequential Processes (CSP ), which has, for example, influenced the development of programming languages ​​Ada, Occam and Go.

Biography

Hoare was born in Colombo, Sri Lanka, the son of British parents. In 1956 he finished his humanistic studies ( Classics ) at Oxford University with a bachelor 's degree.

There followed a year graduate studies in statistics at Oxford before computer-assisted translation of human language further studied at the Moscow State University. In 1960, he began his career at the small computer manufacturer Elliot Brothers with the implementation of Algol 60 and first algorithms studies. He qualified as a professor at Queen's University Belfast in 1968 and returned in 1977 as a professor of computer science at the University of Oxford back.

Hoare is now Professor Emeritus at the University of Oxford and senior researcher at Microsoft Research in Cambridge, England.

Awards

Quotes

" I Conclude thatthere are two ways of constructing a software design: One way is to make it so simple thatthere are obviously no deficiencies and the other way is to make it so complicated thatthere are no Obvious deficiencies. The first method is far more difficult. "

" I realize that there are two ways to create a software design, either so simple that it obviously has no weaknesses, or so complicated that it has no obvious weaknesses. The first method is far more difficult. "

" I think Quicksort is the only really interesting algorithm that I've ever developed. "

"I think Quicksort is the only really interesting algorithm I 've ever made. "

Writings

  • Assertions, A Personal Perspective. In Manfred Broy, Denert (ed.): Software Pioneers - Contributions to Software Engineering. Springer, 2002, ISBN 3-540-43081-4 ( The accompanying DVDs contain a video of the presentation by Tony Hoare, abstracts, and more).
  • An Axiomatic Basis for Computer Programming. In: Communications of the ACM. Vol 14, No 1, 1971 ISSN 0001-0782, pp. 39-45, doi: 10.1145/363235.363259.
  • Proof of a Program: FIND. In: Communications of the ACM. Vol 12, No 10, 1969, ISSN 0001-0782, pp. 576-580, 583, doi: 10.1145/362452.362489 (Reprint in the above mentioned book software Pioneers ).
  • Proof of Correctness of Data Representations. In: Acta Informatica. Vol 1, No. 4, 1972, ISSN 0001-5903, pp. 271-281, doi: 10.1007/BF00289507 (Reprint in the above mentioned book software Pioneers ).
  • Communicating Sequential Processes. Prentice- Hall, 1985 ( PDF version).
  • Retrospective: An Axiomatic Basis for Computer Programming. In: Communications of the ACM. Vol 52, No. 10, 2009 ISSN 0001-0782, pp. 30-32, doi: 10.1145/1562764.1562779.
Occam (programming language) Kyoto Prize IEEE John von Neumann Medal Digital Object Identifier Alan Perlis Maurice Wilkes James H. Wilkinson John McCarthy (computer scientist) Charles Bachman Donald Knuth Allen Newell Herbert A. Simon Michael O. Rabin Kenneth E. Iverson Stephen Cook Niklaus Wirth Richard M. Karp John Cocke Manuel Blum Amir Pnueli Kristen Nygaard Ron Rivest Adi Shamir E. Allen Emerson Joseph Sifakis Charles P. Thacker Judea Pearl Leslie Lamport Integrated Authority File
70755
de