E. Allen Emerson

From Wikipedia, the free encyclopedia

Ernest Allen Emerson is a computer scientist and endowed professor at the University of Texas, Austin.

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 bachelor's degree in mathematics from the University of Texas, Austin in 1976[3] and his PhD in applied mathematics at Harvard University in 1981.[3]

[edit] References

  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).

[edit] External links

v • d • e
A. M. Turing Award laureates

Perlis (1966) · Wilkes (1967) · Hamming (1968) · Minsky (1969) · Wilkinson (1970) · McCarthy (1971) · Dijkstra (1972) · Bachman (1973) · Knuth (1974) · Newell / Simon (1975) · Rabin / Scott (1976) · Backus (1977) · Floyd (1978) · Iverson (1979) · Hoare (1980) · Codd (1981) · Cook (1982) · Thompson / Ritchie (1983) · Wirth (1984) · Karp (1985) · Hopcroft / Tarjan (1986) · Cocke (1987) · Sutherland (1988) · Kahan (1989) · Corbató (1990) · Milner (1991) · Lampson (1992) · Hartmanis / Stearns (1993) · Feigenbaum / Reddy (1994) · Blum (1995) · Pnueli (1996) · Engelbart (1997) · Gray (1998) · Brooks (1999) · Yao (2000) · Dahl / Nygaard (2001) · Rivest / Shamir / Adleman (2002) · Kay (2003) · Cerf / Kahn (2004) · Naur (2005) · Allen (2006) · Clarke / Emerson / Sifakis (2007)
Languages