E. Allen Emerson
From Wikipedia, the free encyclopedia
Ernest Allen Emerson is a computer scientist and endowed professor at the University of Texas, Austin, USA.
He won the 2007 A.M. Turing Award along with Edmund M. Clarke and Joseph Sifakis for their pioneering work on Model checking.[1] He is also the recipient of the 1998 ACM Paris Kanellakis Award Theory and Practice Award for Symbolic Model Checking.[2]
He received his BSc degree in mathematics from the University of Texas, Austin in 1976[3] and his PhD degree in applied mathematics at Harvard University in 1981.[3]
Working with Edmund M. Clarke in the 1980s, he invented computation tree logic[4]
[edit] References
- ^ "ACM Turing Award Honors Founders of Automatic Verification Technology That Enables Faster, More Reliable Designs". University of Texas. 2008-02-04. http://www.cs.utexas.edu/oea/services/media_relations/utcs_spotlights/2008/acm_turing_award/.
- ^ "ACM Fellows Award / E Allen Emerson". http://awards.acm.org/citation.cfm?id=1671460&srt=all&aw=147&ao=KANELLAK.
- ^ a b "Kanellakis Award". Association for Computing Machinery. 1999-03-26. http://www.acm.org/announcements/kanellakis99.html.
- ^ * Michael Huth and Mark Ryan (2004). Logic in Computer Science (Second Edition). Cambridge University Press. p. 207. ISBN 0-521-54310-X.
[edit] External links
- E. Allen Emerson's homepage at the University of Texas at Austin
- E. Allen Emerson at the Mathematics Genealogy Project.
- Turing Award announcement
- Kanellakis Award
- List of publications from the DBLP Bibliography Server.
|
|||||
