E. Allen Emerson

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Edmund Allen Emerson
Born (1954-06-02) 2 June 1954 (age 60)
Dallas, Texas, USA
Nationality American
Fields Computer science
Institutions University of Texas, Austin, USA
Notable awards Paris Kanellakis Award (1998)
Turing award

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]

Emerson is a member of the ACM.


  1. ^ "ACM Turing Award Honors Founders of Automatic Verification Technology That Enables Faster, More Reliable Designs". University of Texas. 2008-02-04. 
  2. ^ "ACM Fellows Award / E Allen Emerson". 
  3. ^ a b "Kanellakis Award". Association for Computing Machinery. 1999-03-26. 
  4. ^ * Michael Huth and Mark Ryan (2004). Logic in Computer Science (Second Edition). Cambridge University Press. p. 207. ISBN 0-521-54310-X. 

External links[edit]