J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e ● C o n t e n t s ● C u r r e n t e v e n t s ● R a n d o m a r t i c l e ● A b o u t W i k i p e d i a ● C o n t a c t u s ● D o n a t e
C o n t r i b u t e
● H e l p ● L e a r n t o e d i t ● C o m m u n i t y p o r t a l ● R e c e n t c h a n g e s ● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t ● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t ● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e ● C o n t r i b u t i o n s ● T a l k
( T o p )
1 E d u c a t i o n a n d e a r l y l i f e
2 R e s e a r c h a n d c a r e e r
3 A w a r d s a n d h o n o u r s
4 P e r s o n a l l i f e
5 B o o k s
6 R e f e r e n c e s
7 E x t e r n a l l i n k s
T o g g l e t h e t a b l e o f c o n t e n t s
T o n y H o a r e
4 2 l a n g u a g e s
● ا ل ع ر ب ي ة ● A z ə r b a y c a n c a ● ت ۆ ر ک ج ه ● ব া ং ল া ● Б ъ л г а р с к и ● B o s a n s k i ● C a t a l à ● Č e š t i n a ● D e u t s c h ● Ε λ λ η ν ι κ ά ● E s p a ñ o l ● E s p e r a n t o ● E u s k a r a ● ف ا ر س ی ● F r a n ç a i s ● 한 국 어 ● Հ ա յ ե ր ե ն ● H r v a t s k i ● B a h a s a I n d o n e s i a ● I t a l i a n o ● ע ב ר י ת ● Қ а з а қ ш а ● M a l a g a s y ● م ص ر ى ● N e d e r l a n d s ● 日 本 語 ● N o r s k b o k m å l ● ਪ ੰ ਜ ਾ ਬ ੀ ● P o l s k i ● P o r t u g u ê s ● R o m â n ă ● Р у с с к и й ● S i m p l e E n g l i s h ● S l o v e n č i n a ● S l o v e n š č i n a ● С р п с к и / s r p s k i ● S r p s k o h r v a t s k i / с р п с к о х р в а т с к и ● S u o m i ● T ü r k ç e ● У к р а ї н с ь к а ● T i ế n g V i ệ t ● 中 文
E d i t l i n k s
● A r t i c l e ● T a l k
E n g l i s h
● R e a d ● E d i t ● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d ● E d i t ● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e ● R e l a t e d c h a n g e s ● U p l o a d f i l e ● S p e c i a l p a g e s ● P e r m a n e n t l i n k ● P a g e i n f o r m a t i o n ● C i t e t h i s p a g e ● G e t s h o r t e n e d U R L ● D o w n l o a d Q R c o d e ● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F ● P r i n t a b l e v e r s i o n
I n o t h e r p r o j e c t s
● W i k i m e d i a C o m m o n s ● W i k i q u o t e
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
( R e d i r e c t e d f r o m C . A . R . H o a r e )
British computer scientist
Sir Charles Antony Richard Hoare FRS FREng [3] Tony Hoare or by his initials C. A. R. Hoare (; born 11 January 1934) is a British computer scientist who has made foundational contributions to programming languages , algorithms , operating systems , formal verification , and concurrent computing .[4] Turing Award , usually regarded as the highest distinction in computer science, in 1980.
Hoare developed the sorting algorithm quicksort in 1959–1960.[5] 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 .[6] [7] [8] [9] [10] [11] University of Oxford and Microsoft Research in Cambridge .
Education and early life [ edit ]
Tony Hoare was born in Colombo , Ceylon (now Sri Lanka ) to British parents; his father was a colonial civil servant and his mother was the daughter of a tea planter. Hoare was educated in England at the Dragon School in Oxford and the King's School in Canterbury .[12] Classics and Philosophy ("Greats") at Merton College, Oxford .[13] National Service in the Royal Navy ,[13] [14] University of Oxford in 1958 to study for a postgraduate certificate in statistics ,[13] computer programming , having been taught Autocode on the Ferranti Mercury by Leslie Fox .[15] Moscow State University as a British Council exchange student,[13] machine translation under Andrey Kolmogorov .[14]
Research and career [ edit ]
In 1960, Hoare left the Soviet Union and began working at Elliott Brothers Ltd ,[13] ALGOL 60 and began developing major algorithms .[16] [17]
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,[18] specified , maintains, and supports the languages ALGOL 60 and ALGOL 68 .[19]
He became the Professor of Computing Science at the Queen's University of Belfast in 1968, and in 1977 returned to Oxford as the Professor of Computing to lead the Programming Research Group in the Oxford University Computing Laboratory (now Department of Computer Science, University of Oxford ), following the death of Christopher Strachey . He became the first Christopher Strachey Professor of Computing on its establishment in 1988 until his retirement at Oxford in 2000.[20] Emeritus Professor there, and is also a principal researcher at Microsoft Research in Cambridge , England.[21] [22] [23]
Hoare's most significant work has been in the following areas: his sorting and selection algorithm (Quicksort and Quickselect ), Hoare logic , the formal language communicating sequential processes (CSP) used to specify the interactions between 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 .[24] [25]
Speaking at a software conference in 2009, Tony Hoare hyperbolically apologized for "inventing" the null reference :[26] [27]
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.[28]
For many years under his leadership, Hoare's Oxford department worked on formal specification languages such as CSP and Z [29]
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.
A commemorative article was written in tribute to Hoare on his 90th birthday.[30]
Awards and honours [ edit ]
ACM Programming Systems and Languages Paper Award (1973)[31] [32]
Distinguished Fellow of the British Computer Society (1978)
Turing Award for "fundamental contributions to the definition and design of programming languages ". The award was presented to him at the ACM Annual Conference in Nashville, Tennessee , on 27 October 1980, by Walter Carlson, chairman of the Awards committee. A transcript of Hoare's speech[33] Communications of the ACM [16]
Harry H. Goode Memorial Award (1981)
Fellow of the Royal Society (1982)[34]
Honorary Doctorate of Science by the Queen's University Belfast (1987)
Honorary Doctorate of Science, from the University of Bath (1993)[35]
Honorary Fellow, Kellogg College, Oxford (1998)[36]
Knighted for services to education and computer science (2000 )
Kyoto Prize for Information science (2000)
Fellow [3] Royal Academy of Engineering [3]
Member of the National Academy of Engineering (2006) for fundamental contributions to computer science in the areas of algorithms, operating systems, and programming languages.
Computer History Museum (CHM) in Mountain View, California Fellow of the Museum "for development of the Quicksort algorithm and for lifelong contributions to the theory of programming languages " (2006)[37]
Honorary Doctorate from Heriot-Watt University (2007)[38]
Honorary Doctorate of Science from the Department of Informatics of the Athens University of Economics and Business (AUEB) (2007)
Friedrich L. Bauer-Prize, Technical University of Munich (2007)[39]
SIGPLAN Programming Languages Achievement Award (2011)[40]
IEEE John von Neumann Medal (2011)[41]
Honorary Doctorate, University of Warsaw (2012)[42]
Honorary Doctorate, Complutense University of Madrid (2013)[43]
Royal Medal of the Royal Society (2023)[44]
Personal life [ edit ]
In 1962, Hoare married Jill Pym , a member of his research team.[45]
References [ edit ]
^ Sampaio, Augusto (1993). An algebraic approach to compiler design bodleian.ox.ac.uk (DPhil thesis). University of Oxford. OCLC 854973008 . EThOS uk.bl.ethos.334903 . [permanent dead link
^ a b c "List of Fellows" . Archived from the original on 8 June 2016. Retrieved 17 October 2014 .
^ Jones, Cliff B. ; Misra, Jayadev , eds. (2021). Theories of Programming: The Life and Works of Tony Hoare . ACM Books. Vol. 39. New York, NY: Association for Computing Machinery . doi :10.1145/3477355 . ISBN 978-1-4503-8728-6 S2CID 238251696 .
^ "Sir Antony Hoare" . Computer History Museum. Archived from the original on 3 April 2015. Retrieved 22 April 2015 .
^ Tony Hoare author profile page at the ACM Digital Library
^ C. A. R. Hoare at DBLP Bibliography Server
^ Tony Hoare publications indexed by Microsoft Academic
^ Shustek, L. (2009). "Interview: An interview with C.A.R. Hoare". Communications of the ACM 52 3 ): 38–41. doi :10.1145/1467247.1467261 . S2CID 1868477 .
^ Hoare, C. A. R. (1974). "Monitors: An operating system structuring concept" . Communications of the ACM . 17 10 ): 549–557. doi :10.1145/355620.361161 S2CID 1005769 .
^ 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 )
^ 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 .
^ a b c d e Levens, R.G.C., ed. (1964). Merton College Register 1900-1964 . Oxford: Basil Blackwell. p. 434.
^ a b Hoare, Tony (Autumn 2009). "My Early Days at Elliotts" . Resurrection (48 ). ISSN 0958-7403 . Retrieved 27 May 2014 .
^ Roscoe, Bill ; Jones, Cliff (2010). "1 Insight, inspiration and collaboration" (PDF) . Reflections on the Work of C.A.R. Hoare . Springer . ISBN 978-1-84882-911-4 Archived (PDF) from the original on 9 October 2022.
^ a b Hoare, C.A.R. (February 1981). "The emperor's old clothes" . Communications of the ACM 24 2 ): 5–83. doi :10.1145/358549.358561 ISSN 0001-0782 .
^ Hoare, C. A. R. (1981). "The emperor's old clothes" . Communications of the ACM . 24 2 ): 75–83. doi :10.1145/358549.358561
^ Jeuring, Johan; Meertens, Lambert ; Guttmann, Walter (17 August 2016). "Profile of IFIP Working Group 2.1" . Foswiki . Retrieved 7 October 2020 .
^ Swierstra, Doaitse; Gibbons, Jeremy ; Meertens, Lambert (2 March 2011). "ScopeEtc: IFIP21: Foswiki" . Foswiki . Retrieved 7 October 2020 .
^ "Christopher Strachey Professorship of Computing" . Department of Computer Science, University of Oxford . 5 November 2021. Retrieved 18 January 2024 .
^ Microsoft home page – short biography
^ Oral history interview with C. A. R. Hoare at Charles Babbage Institute , University of Minnesota, Minneapolis.
^ The classic article on monitors – The original article on monitors
^ "Preface to the ACM Turing Award lecture" (PDF) . Archived from the original (PDF) on 19 April 2012.
^ "C. Antony (Tony) R. Hoare" . Archived from the original on 1 July 2012.
^ Hoare, Tony (25 August 2009). "Null References: The Billion Dollar Mistake" . InfoQ.com.
^ "Null: The Billion Dollar Mistake" . hashnode.com. 3 September 2020.
^
Hoare, Tony (2009). "Null References: The Billion Dollar Mistake" (Presentation abstract). QCon London. Archived from the original on 28 June 2009.
^ Hoare, C. A. R. (1996). "Unification of Theories: A Challenge for Computing Science". Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification . Springer-Verlag. pp. 49–57. ISBN 3-540-61629-2
^
Jifeng, He; Jones, Cliff; Roscoe, Bill; Stoy, Joe; Sufrin, Bernard; Bowen, Jonathan (2 July 2024). "Tony Hoare @ 90" (PDF) . FACS FACTS (Magazine article). Formal Aspects of Computing Science (FACS) Specialist Group. pp. 5–42. ISSN 0950-1231 . Archived (PDF) from the original on 10 July 2024. Retrieved 10 July 2024 .
^ "ACM Programming Systems and Languages Paper Award" . Association for Computing Machinery. 1973. Retrieved 7 July 2022 .
^ Hoare, C.A.R. (1972). "Proof of correctness of data representations" . Communications of the ACM 1 4 ): 271–281. doi :10.1007/BF00289507 . S2CID 34414224 .
^ 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.
^ Anon (1982). "Anthony Hoare FRS" . royalsociety.org . London: Royal Society .
^ "Honorary Graduates 1989 to present" . bath.ac.uk . University of Bath . Archived from the original on 17 July 2010. Retrieved 18 February 2012 .
^ "(Charles) Antony Richard (Tony) Hoare Biography" . Archived from the original on 17 July 2014.
^ "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 .
^ "Annual Review 2007: Principal's Review" . www1.hw.ac.uk . Archived from the original on 5 March 2016. Retrieved 29 March 2016 .
^ "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 .
^ "Programming Languages Achievement Award 2011" . ACM. Retrieved 28 August 2012 .
^ "IEEE John von Neumann Medal Recipients" (PDF) . IEEE. Archived (PDF) from the original on 9 October 2022. Retrieved 26 February 2011 .
^ 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 .
^ "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 .
^ Royal Medal 2023
^ Jones, Cliff ; Roscoe, A. W. ; Wood, Kenneth R., eds. (2010). Reflections on the Work of C.A.R. Hoare 3 Bibcode :2010rwch.book.....R .
text available under the CC BY 4.0 license.
External links [ edit ]
t
e
Fields
Concepts
Orientations
Models
Developmental
Other
Languages
Related fields
t
e
1960s
1970s
1980s
1990s
2000s
2010s
2020s
International
National
Academics
People
Other
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=Tony_Hoare&oldid=1233758355 " C a t e g o r i e s : ● 1 9 3 4 b i r t h s ● L i v i n g p e o p l e ● P e o p l e f r o m C o l o m b o ● P e o p l e e d u c a t e d a t T h e D r a g o n S c h o o l ● P e o p l e e d u c a t e d a t T h e K i n g ' s S c h o o l , C a n t e r b u r y ● A l u m n i o f M e r t o n C o l l e g e , O x f o r d ● A c a d e m i c s o f Q u e e n ' s U n i v e r s i t y B e l f a s t ● B r i t i s h c o m p u t e r s c i e n t i s t s ● F e l l o w s o f t h e B r i t i s h C o m p u t e r S o c i e t y ● F e l l o w s o f t h e R o y a l A c a d e m y o f E n g i n e e r i n g ● F e l l o w s o f t h e R o y a l S o c i e t y ● F o r e i g n a s s o c i a t e s o f t h e N a t i o n a l A c a d e m y o f S c i e n c e s ● F e l l o w s o f W o l f s o n C o l l e g e , O x f o r d ● F o r m a l m e t h o d s p e o p l e ● H i s t o r y o f c o m p u t i n g i n t h e U n i t e d K i n g d o m ● K n i g h t s B a c h e l o r ● K y o t o l a u r e a t e s i n A d v a n c e d T e c h n o l o g y ● M e m b e r s o f t h e D e p a r t m e n t o f C o m p u t e r S c i e n c e , U n i v e r s i t y o f O x f o r d ● M i c r o s o f t e m p l o y e e s ● M o s c o w S t a t e U n i v e r s i t y a l u m n i ● P r o g r a m m i n g l a n g u a g e r e s e a r c h e r s ● T u r i n g A w a r d l a u r e a t e s ● C o m p u t e r s c i e n c e w r i t e r s ● B r i t i s h e x p a t r i a t e s i n S r i L a n k a ● B r i t i s h e x p a t r i a t e s i n t h e S o v i e t U n i o n ● F e l l o w s o f M e r t o n C o l l e g e , O x f o r d H i d d e n c a t e g o r i e s : ● A l l a r t i c l e s w i t h d e a d e x t e r n a l l i n k s ● A r t i c l e s w i t h d e a d e x t e r n a l l i n k s f r o m D e c e m b e r 2 0 2 3 ● A r t i c l e s w i t h p e r m a n e n t l y d e a d e x t e r n a l l i n k s ● C S 1 m a i n t : b o t : o r i g i n a l U R L s t a t u s u n k n o w n ● C S 1 G e r m a n - l a n g u a g e s o u r c e s ( de ) ● C S 1 P o l i s h - l a n g u a g e s o u r c e s ( pl ) ● C S 1 S p a n i s h - l a n g u a g e s o u r c e s ( es ) ● A r t i c l e s w i t h s h o r t d e s c r i p t i o n ● S h o r t d e s c r i p t i o n m a t c h e s W i k i d a t a ● U s e B r i t i s h E n g l i s h f r o m A u g u s t 2 0 1 4 ● U s e d m y d a t e s f r o m A u g u s t 2 0 1 4 ● A r t i c l e s w i t h h C a r d s ● A r t i c l e s w i t h i m p o r t e d C r e a t i v e C o m m o n s A t t r i b u t i o n 4 . 0 t e x t ● C o m m o n s c a t e g o r y l i n k i s o n W i k i d a t a ● O f f i c i a l w e b s i t e d i f f e r e n t i n W i k i d a t a a n d W i k i p e d i a ● A r t i c l e s w i t h F A S T i d e n t i f i e r s ● A r t i c l e s w i t h I S N I i d e n t i f i e r s ● A r t i c l e s w i t h V I A F i d e n t i f i e r s ● A r t i c l e s w i t h W o r l d C a t E n t i t i e s i d e n t i f i e r s ● A r t i c l e s w i t h B I B S Y S i d e n t i f i e r s ● A r t i c l e s w i t h G N D i d e n t i f i e r s ● A r t i c l e s w i t h I C C U i d e n t i f i e r s ● A r t i c l e s w i t h J 9 U i d e n t i f i e r s ● A r t i c l e s w i t h K B R i d e n t i f i e r s ● A r t i c l e s w i t h L C C N i d e n t i f i e r s ● A r t i c l e s w i t h L i b r i s i d e n t i f i e r s ● A r t i c l e s w i t h L N B i d e n t i f i e r s ● A r t i c l e s w i t h N D L i d e n t i f i e r s ● A r t i c l e s w i t h N K C i d e n t i f i e r s ● A r t i c l e s w i t h N L A i d e n t i f i e r s ● A r t i c l e s w i t h N S K i d e n t i f i e r s ● A r t i c l e s w i t h N T A i d e n t i f i e r s ● A r t i c l e s w i t h P L W A B N i d e n t i f i e r s ● A r t i c l e s w i t h A C M - D L i d e n t i f i e r s ● A r t i c l e s w i t h C I N I I i d e n t i f i e r s ● A r t i c l e s w i t h D B L P i d e n t i f i e r s ● A r t i c l e s w i t h M A T H S N i d e n t i f i e r s ● A r t i c l e s w i t h M G P i d e n t i f i e r s ● A r t i c l e s w i t h S c o p u s i d e n t i f i e r s ● A r t i c l e s w i t h Z B M A T H i d e n t i f i e r s ● A r t i c l e s w i t h T r o v e i d e n t i f i e r s ● A r t i c l e s w i t h S N A C - I D i d e n t i f i e r s ● A r t i c l e s w i t h S U D O C i d e n t i f i e r s
● T h i s p a g e w a s l a s t e d i t e d o n 1 0 J u l y 2 0 2 4 , a t 1 8 : 5 9 ( U T C ) . ● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n . ● P r i v a c y p o l i c y ● A b o u t W i k i p e d i a ● D i s c l a i m e r s ● C o n t a c t W i k i p e d i a ● C o d e o f C o n d u c t ● D e v e l o p e r s ● S t a t i s t i c s ● C o o k i e s t a t e m e n t ● M o b i l e v i e w
This article incorporates text available under the CC BY 4.0 license.
