2026 E. Allen Emerson: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	54	4424	4299	2067	1993	132	31106

Research.com Recognitions

2007 - A. M. Turing Award Together with Edmund Clarke and Joseph Sifakis, for their role in developing Model-Checking into a highly effective verification technology that is widely adopted in the hardware and software industries.
1998 - ACM Paris Kanellakis Theory and Practice Award

Overview

E. Allen Emerson is affiliated with The University of Texas at Austin in the United States. Their primary area of research lies within Computer Science, with a focus on subfields such as Artificial Intelligence and Computational Theory and Mathematics.

Their work covers several main topics related to computing, including:

Logic, programming, and type systems
Formal Methods in Verification
Security and Verification in Computing

The academic output of E. Allen Emerson includes publications predominantly in the areas mentioned above, revealing a consistent concentration on formal methods and verification technologies.

Emerson has received significant recognition from the professional community, including two notable awards. In 2007, they were honored with the A. M. Turing Award for their collaborative role in developing Model-Checking as a verification technology widely adopted in hardware and software industries. Earlier, in 1998, they received the ACM Paris Kanellakis Theory and Practice Award.

Their research demonstrates a clear contribution to the intersection of theoretical computer science and practical verification solutions used in computing security and software reliability.

Best Publications

DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC

Edmund M. Clarke;E. Allen Emerson

6423
Citations
Automatic verification of finite-state concurrent systems using temporal logic specifications

E. M. Clarke;E. A. Emerson;A. P. Sistla

5795
Citations
Temporal and modal logic

E. Allen Emerson

3983
Citations
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

E. Allen Emerson;Joseph Y. Halpern

1739
Citations
Using branching time temporal logic to synthesize synchronization skeletons

E.Allen Emerson;Edmund M. Clarke

1047
Citations
EFFICIENT MODEL CHECKING IN FRAGMENTS OF THE PROPOSITIONAL MU-CALCULUS.

E. Allen Emerson;Chin Laung Lei

848
Citations
Symmetry and model checking

E. Allen Emerson;A. Prasad Sistla

838
Citations
Decision procedures and expressiveness in the temporal logic of branching time

E. A. Emerson;Joseph Y. Halpern

798
Citations
Modalities for model checking: branching time logic strikes back

E. Allen Emerson;Chin-Laung Lei

712
Citations
The complexity of tree automata and logics of programs

Unknown

524
Citations
Characterizing Correctness Properties of Parallel Programs Using Fixpoints

E. Allen Emerson;Edmund M. Clarke

488
Citations
On Model-Checking for Fragments of µ-Calculus

E. Allen Emerson;Charanjit S. Jutla;A. Prasad Sistla

424
Citations
Model checking: algorithmic verification and debugging

Edmund M. Clarke;E. Allen Emerson;Joseph Sifakis

388
Citations
An automata theoretic decision procedure for the propositional mu-calculus

Robert S. Streett;E. Allen Emerson

324
Citations
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)

E. Allen Emerson;Charanjit S. Jutla

312
Citations
Reasoning about rings

E. Allen Emerson;Kedar S. Namjoshi

290
Citations
Reducing Model Checking of the Many to the Few

E. Allen Emerson;Vineet Kahlon

287
Citations
Quantitative Temporal Reasoning

E. Allen Emerson;Aloysius K. Mok;A. Prasad Sistla;Jai Srinivasan

274
Citations
Symmetry Reductions inModel Checking

Edmund M. Clarke;E. Allen Emerson;Somesh Jha;A. Prasad Sistla

250
Citations
Decision procedures and expressiveness in the temporal logic of branching time

E. Allen Emerson;Joseph Y. Halpern

231
Citations
Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract)

E. Allen Emerson;Chin-Laung Lei

116
Citations

Frequent Co-Authors

A. Prasad Sistla University of Illinois at Chicago

Edmund M. Clarke Carnegie Mellon University

Charanjit S. Jutla IBM (United States)

Chin-Laung Lei National Taiwan University

Aloysius K. Mok The University of Texas at Austin

David L. Dill Stanford University

Joseph Y. Halpern Cornell University

Joseph Sifakis Verimag

Anish Arora The Ohio State University

Jacob A. Abraham The University of Texas at Austin

External Links

Wikipedia of E. Allen Emerson Personal website of E. Allen Emerson

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring alternative or complementary degrees can significantly expand your career options in the technology sector. Online programs make it easier and more affordable than ever to gain new expertise while maintaining your current commitments.

If you’re interested in broadening your scientific knowledge, consider looking into the cheapest online physics degree options available. These programs offer a solid foundation for tech roles that require critical thinking and quantitative skills.

For students who want to enter data-driven industries, affordable data science programs in the USA provide a gateway into fields like analytics and machine learning. Completing a online bachelor’s in electrical engineering can open doors to careers in electronics, automation, and telecommunications.

Additionally, earning easy certifications to get can quickly boost your employability and potentially lead to higher-paying jobs, especially when combined with your computer science background.