E. Allen Emerson Explained

E. Allen Emerson
Birth Date:2 June 1954
Birth Place:Dallas, Texas, U.S.
Death Place:Austin, Texas, U.S.
Field:Computer science
Work Institution:University of Texas at Austin
Education:
Doctoral Advisor:Edmund M. Clarke
Known For:
Awards:

    Ernest Allen Emerson II (June 2, 1954 – October 15, 2024) was an American computer scientist and winner of the 2007 Turing Award. He was Professor and Regents Chair at the University of Texas at Austin.

    Emerson is recognized together with Edmund M. Clarke and Joseph Sifakis for the invention anddevelopment of model checking, a technique used in formal verification of software and hardware.[1] His contributions to temporal logic and modal logic include the introduction of computation tree logic (CTL)[2] and its extension CTL*,[3] which are used in the verification of concurrent systems.He is also recognized along with others for developing symbolic model checking to address combinatorial explosion that arises in many model checking algorithms.[4]

    Early life and education

    Emerson was born in Dallas, Texas, on June 2, 1954. His early experiences with computing included exposure to BASIC, Fortran, and ALGOL 60 on the Dartmouth Time-Sharing System and Burroughs large systems computers.[1] He went on to receive a Bachelor of Science degree in mathematics from the University of Texas at Austin in 1976 and a Doctor of Philosophy degree in applied mathematics at Harvard University in 1981.[1]

    Career

    In the early 1980s, Emerson and his PhD advisor, Edmund M. Clarke, developed techniques for verifying a finite-state system against a formal specification. They coined the term model checking for the concept, which was independently studied by Joseph Sifakis in Europe.[1] This sense of the word model matches the usage from model theory in mathematical logic: the system is called a model of the specification.

    Emerson's work on model checking included early and influential temporal logics for describing specifications, and techniques for reducing state space explosion.[1]

    Awards

    In 2007, Emerson, Clarke, and Sifakis won the Turing award.[1] The citation reads:

    In addition to the Turing award, Emerson received the 1998 ACM Paris Kanellakis Award,together with Randal Bryant, Clarke, and Kenneth L. McMillan for the development of symbolic model checking.[4] The citation reads:

    Death

    Emerson died at his home in Austin on October 15, 2024, at the age of 70.[5] [6]

    See also

    External links

    Notes and References

    1. Web site: E. Allen Emerson - A.M. Turing Award Laureate . 2022-09-02 . amturing.acm.org.
    2. Book: Clarke . Edmund M. . Emerson . E. Allen . 1982 . Kozen . Dexter . Design and synthesis of synchronization skeletons using branching time temporal logic . https://link.springer.com/chapter/10.1007/BFb0025774 . Logics of Programs . Lecture Notes in Computer Science . 131 . en . Berlin, Heidelberg . Springer . 52–71 . 10.1007/BFb0025774 . 978-3-540-39047-3.
    3. Emerson . E. Allen . Halpern . Joseph Y. . 1986-01-02 . "Sometimes" and "not never" revisited: on branching versus linear time temporal logic . Journal of the ACM . 33 . 1 . 151–178 . 10.1145/4904.4999 . 10852931 . 0004-5411. free .
    4. Web site: AWARDS -- E. ALLEN EMERSON -- 'ACM A.M. Turing Award' and 'Paris Kanellakis Theory and Practice Award' . https://web.archive.org/web/20150606060753/http://awards.acm.org/award_winners/emerson_1671460.cfm . June 6, 2015 . July 21, 2015 . . 2015 . live . […] authored seminal papers that founded what has become the highly successful field of Model Checking. . mdy .
    5. Web site: WE BID FAREWELL TO E. ALLEN EMERSON . Heidelberg Laureate Forum Foundation . 19 October 2024.
    6. Web site: Ernest "Allen" Emerson II. Weed Corley Fish Funeral Homes and Cremation Services. October 20, 2024.