Peter O'Hearn

From Wikipedia, the free encyclopedia

Peter O'Hearn

FRS FREng
Peter O'Hearn Royal Society.jpg
Peter O'Hearn at the Royal Society admissions day in London, July 2018
Born
Peter William O'Hearn

(1963-07-13) 13 July 1963 (age 58)
Halifax, Nova Scotia, Canada
NationalityBritish, Canadian
CitizenshipUnited Kingdom, Canada
Alma materDalhousie University (BSc)
Queen's University (MSc, PhD)
Known forSeparation logic[1]
Bunched logic[2]
Infer Static Analyzer[3]
Awards
Scientific career
FieldsProgramming languages[12]
Program analysis
Formal verification
Theoretical computer science[12]
InstitutionsFacebook
University College London
Queen Mary University of London
Syracuse University
ThesisSemantics of Non-interference: A natural approach (1992)
Doctoral advisorRobert D. Tennent[13]
InfluencesJohn C. Reynolds[14]
Websitewww0.cs.ucl.ac.uk/staff/p.ohearn/

Peter William O'Hearn FRS FREng[7][9] (born 13 July 1963 in Halifax, Nova Scotia) is a research scientist at Facebook[15] and a Professor of Computer science at University College London (UCL).[16] He has made significant contributions to formal methods for program correctness. In recent years these advances have been employed in developing industrial software tools that conduct automated analysis of large industrial codebases.[12]

Education[]

O'Hearn attained a BSc degree in computer science from Dalhousie University, Halifax, Nova Scotia (1985), followed by MSc (1987) and PhD (1991) degrees from Queen's University, Kingston, Ontario, Canada. His dissertation was on Semantics of Non-interference: A natural approach, supervised by Robert D. Tennent.[13][17]

Career and research[]

O'Hearn is best known for separation logic,[1] a theory he developed with John C. Reynolds that unearthed new domains for scaling logical reasoning about code. This built on prior research from O'Hearn and David Pym on logic for resources, termed bunched logic.[2] With Stephen Brookes, Carnegie Mellon University, O'Hearn created Concurrent Separation Logic (CSL), extending the theory further. Tony Hoare, in discussing the grand challenge of program verification, described CSL as "solving two problems...concurrecy and object orientation".[18] [19]

He conducted a study of programming languages which were similar to ALGOL, with his former doctoral advisor Robert D. Tennent, which became the book Algol-Like Languages.[20]

Separation logic has given rise to the Infer Static Analyzer (Facebook Infer), a static program analysis utility developed by O'Hearn's team at Facebook.[3] After 20 plus years in academia, O'Hearn began working at Facebook in 2013 with the acquisition of Monoidics Ltd, a startup he cofounded.[21] Since its inception, Infer has enabled Facebook engineers to resolve tens of thousands of bugs before reaching production.[22] It was open sourced in 2016, and is used by Amazon Inc, Spotify, Mozilla, Uber, and others.[3] In 2017, O'Hearn and the team open sourced RacerD, an automated static race condition detection tool that reduces the time it takes to flag potential problems in concurrent software, as part of the Infer platform.[23]

O'Hearn was an assistant professor at Syracuse University, New York, United States, from 1990 to 1995. He was a reader in computer science at Queen Mary University of London from 1996 to 1999 and then a full professor at Queen Mary until his move to University College London. At UCL he was granted a Chair sponsored by the Royal Academy of Engineering and Microsoft Research.[24] In 1997 he was a visiting scientist at Carnegie Mellon University and in 2006 he was a visiting researcher at Microsoft Research Cambridge.[17] He now shares his time working as a research scientist at Facebook and a professor at UCL.[citation needed]

Awards and honours[]

In 2007, O'Hearn was granted a Royal Society Wolfson Research Merit Award.[7] In 2011, O'Hearn and Samin Ishtiaq were awarded a Most Influential POPL Paper Award.[11] With Stephen Brookes, Carnegie Mellon University, he was corecipient of the 2016 Gödel Prize, for the invention of Concurrent Separation Logic.[8] Also in 2016, he was elected Fellow of the Royal Academy of Engineering (FREng) and co-received the annual CAV (Computer Aided Verification) award.[9][10] In 2018, he was elected Fellow of the Royal Society (FRS), and was bestowed with an Honorary Doctor of Laws from Dalhousie University.[6][7][5] January 2019 saw O'Hearn honoured with another Most Influential POPL Paper Award, which he shared with three colleagues.[4]

References[]

  1. ^ Jump up to: a b Reynolds, John C. (2002). "Separation Logic: A Logic for Shared Mutable Data Structures" (PDF). LICS.
  2. ^ Jump up to: a b O'Hearn, P. W.; Pym, D. J. (June 1999). "The Logic of Bunched Implications". Bulletin of Symbolic Logic. 5 (2): 215–244. doi:10.2307/421090. JSTOR 421090. S2CID 2948552.
  3. ^ Jump up to: a b c "Infer static analyzer". fbinfer.com.
  4. ^ Jump up to: a b "POPL 2019 Most Influential Paper Award for research that led to Facebook Infer". Facebook. 17 January 2019.
  5. ^ Jump up to: a b "Introducing Dal's honorary degree recipients for Spring Convocation 2018".
  6. ^ Jump up to: a b "Distinguished scientists elected as Fellows and Foreign Members of the Royal Society". royalsociety.org. Retrieved 15 May 2018.
  7. ^ Jump up to: a b c d e Anon (2018). "Professor Peter O'Hearn FRS". royalsociety.org. London: Royal Society. Archived from the original on 7 June 2018. One or more of the preceding sentences incorporates text from the royalsociety.org website where:

    “All text published under the heading 'Biography' on Fellow profile pages is available under Creative Commons Attribution 4.0 International License.” --"Terms, conditions and policies | Royal Society". Archived from the original on 11 November 2016. Retrieved 7 June 2018.CS1 maint: bot: original URL status unknown (link)
  8. ^ Jump up to: a b Chita, Efi (12–15 July 2016). "2016 Gödel Prize". European Association for Theoretical Computer Science.
  9. ^ Jump up to: a b c https://www.raeng.org.uk/about-us/the-fellowship/new-fellows-2016/fellows/peter-o-hearn
  10. ^ Jump up to: a b O'Sullivan, Bryan (5 September 2016). "Four Facebook Employees Win the Prestigious CAV Award". Facebook.
  11. ^ Jump up to: a b "Computer Science professor wins prestigious award". Queen Mary University of London. 3 February 2011.
  12. ^ Jump up to: a b c Peter O'Hearn publications indexed by Google Scholar Edit this at Wikidata
  13. ^ Jump up to: a b Peter O'Hearn at the Mathematics Genealogy Project Edit this at Wikidata
  14. ^ Olivier Danvy, Peter O'Hearn and Philip Wadler (editors), Festschrift for John C. Reynolds's 70th Birthday. Theoretical Computer Science, 375(1–3):1–350, 1 May 2007. Editorial, pages 1–2.doi:10.1016/j.tcs.2006.12.024
  15. ^ "Peter O'Hearn". Facebook Research.
  16. ^ "Peter O'Hearn". www0.cs.ucl.ac.uk.
  17. ^ Jump up to: a b Peter W O'Hearn, Curriculum Vitae Archived 2011-07-19 at the Wayback Machine, Queen Mary, University of London, UK.
  18. ^ https://www.facebook.com/academics/videos/2228616734102290/?t=3775
  19. ^ Hoare, Tony (2003). "The verifying compiler". Journal of the ACM. 50: 63–69. doi:10.1145/602382.602403. S2CID 441648.
  20. ^ O'Hearn, Peter; Tennent, Robert D. (1997). Algol-Like Languages. Cambridge, Massachusetts, United States: Birkhauser Boston. doi:10.1007/978-1-4612-4118-8. ISBN 978-0-8176-3880-1. S2CID 6273486.
  21. ^ "Facebook Acquires Assets Of UK Mobile Bug-Checking Software Developer Monoidics". TechCrunch. Verizon Media.
  22. ^ "Continuous Reasoning: Scaling the Impact of Formal Methods". Facebook Research.
  23. ^ "Facebook open sources RacerD: A tool that's already squashed 1,000 bugs in concurrent code". TechRepublic. 19 October 2017.
  24. ^ "Spring Newsletter" (PDF). raeng.org.uk. 2012.

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

Retrieved from ""