E. Allen Emerson

20.7k total citations · 1 hit paper
76 papers, 6.3k citations indexed

About

E. Allen Emerson is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, E. Allen Emerson has authored 76 papers receiving a total of 6.3k indexed citations (citations by other indexed papers that have themselves been cited), including 61 papers in Computational Theory and Mathematics, 47 papers in Artificial Intelligence and 25 papers in Software. Recurrent topics in E. Allen Emerson's work include Formal Methods in Verification (61 papers), Logic, programming, and type systems (40 papers) and semigroups and automata theory (16 papers). E. Allen Emerson is often cited by papers focused on Formal Methods in Verification (61 papers), Logic, programming, and type systems (40 papers) and semigroups and automata theory (16 papers). E. Allen Emerson collaborates with scholars based in United States, Netherlands and Ireland. E. Allen Emerson's co-authors include A. Prasad Sistla, E. M. Clarke, Joseph Y. Halpern, Charanjit S. Jutla, Edmund M. Clarke, Chin‐Laung Lei, Kedar S. Namjoshi, Paul C. Attie, Joseph Sifakis and Aloysius K. Mok and has published in prestigious journals such as Communications of the ACM, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

E. Allen Emerson

74 papers receiving 5.6k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

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

1986 1.9k citations E. Allen Emerson, A. Prasad Sistla et al. profile →

Peers

E. Allen Emerson

CTM

AI

SOFTW

HA

CNC

Orna Grümberg Israel

Christel Baier Germany

Zohar Manna United States

D. Long United States

Gerard J. Holzmann United States

A. Prasad Sistla United States

Pierre Wolper Belgium

Kenneth L. McMillan United States

Gerard J. Holzmann United States

Klaus Havelund United States

Orna Grümberg Israel

E. Allen Emerson

5.1k ×1.0

CTM

3.3k ×0.9

AI

3.2k ×1.5

SOFTW

1.1k ×1.2

HA

909 ×1.0

CNC

Citations per year, relative to E. Allen Emerson E. Allen Emerson (= 1×) peers Orna Grümberg

Countries citing papers authored by E. Allen Emerson

Since Specialization

Citations

This map shows the geographic impact of E. Allen Emerson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by E. Allen Emerson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites E. Allen Emerson more than expected).

Fields of papers citing papers by E. Allen Emerson

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by E. Allen Emerson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by E. Allen Emerson. The network helps show where E. Allen Emerson may publish in the future.

Co-authorship network of co-authors of E. Allen Emerson

This figure shows the co-authorship network connecting the top 25 collaborators of E. Allen Emerson. A scholar is included among the top collaborators of E. Allen Emerson based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with E. Allen Emerson. E. Allen Emerson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Vasudevan, Shobha, E. Allen Emerson, & Jacob A. Abraham. (2006). Improved verification of hardware designs through antecedent conditioned slicing. International Journal on Software Tools for Technology Transfer. 9(1). 89–101. 12 indexed citations

2.

Emerson, E. Allen & Vineet Kahlon. (2003). Model checking guarded protocols. 361–370. 23 indexed citations

3.

Emerson, E. Allen, et al.. (2002). On the limits of efficient temporal decidability. 32. 4640–4675. 2 indexed citations

4.

Emerson, E. Allen, Charanjit S. Jutla, & A. Prasad Sistla. (2001). On model checking for the μ-calculus and its fragments. Theoretical Computer Science. 258(1-2). 491–522. 42 indexed citations

5.

Emerson, E. Allen & A. Prasad Sistla. (2000). Computer aided verification : 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000 : proceedings. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 2 indexed citations

6.

Emerson, E. Allen. (2000). Automated formal methods. ACM SIGSOFT Software Engineering Notes. 25(1). 49–49. 3 indexed citations

7.

Attie, Paul C. & E. Allen Emerson. (1996). Synthesis of Concurrent Systems for an Atomic Read / Atomic Write Model of Computation (Extended Abstract).. 111–120. 3 indexed citations

8.

Emerson, E. Allen & Charanjit S. Jutla. (1991). Tree Automata, Mu-Calculus and Determinacy (Extended Abstract). 78 indexed citations

9.

Attie, Paul C. & E. Allen Emerson. (1989). Synthesis of concurrent systems with many similar sequential processes. 191–201. 5 indexed citations

10.

Emerson, E. Allen & Charanjit S. Jutla. (1989). On Simultaneously Determinizing and Complementing omega-Automata (Extended Abstract). 333–342. 4 indexed citations

11.

Emerson, E. Allen, et al.. (1989). Efficient Temporal Reasoning.. 166–178. 7 indexed citations

12.

Emerson, E. Allen & Charanjit S. Jutla. (1988). The Complexity of Tree Automata and Logics of Programs (Extended Abstract). 328–337. 30 indexed citations

13.

Emerson, E. Allen & Chin‐Laung Lei. (1987). Modalities for model checking: branching time logic strikes back. Science of Computer Programming. 8(3). 275–306. 153 indexed citations

14.

Emerson, E. Allen & Chin‐Laung Lei. (1986). Efficient Model Checking in Fragments of the Propositional Mu-Calculus (Extended Abstract). 267–278. 30 indexed citations

15.

Emerson, E. Allen, et al.. (1986). EFFICIENT MODEL CHECKING IN FRAGMENTS OF THE PROPOSITIONAL MU-CALCULUS.. 267–278. 194 indexed citations

16.

Emerson, E. Allen & Joseph Y. Halpern. (1985). Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences. 30(1). 1–24. 208 indexed citations

17.

Emerson, E. Allen, et al.. (1985). Branching Time Logic Strikes Back. 2 indexed citations

18.

Emerson, E. Allen & A. Prasad Sistla. (1984). Deciding full branching time logic. Information and Control. 61(3). 175–201. 95 indexed citations

19.

Emerson, E. Allen. (1983). Alternative semantics for temporal logics. Theoretical Computer Science. 26(1-2). 121–130. 42 indexed citations

20.

Emerson, E. Allen & Edmund M. Clarke. (1982). Using branching time temporal logic to synthesize synchronization skeletons. Science of Computer Programming. 2(3). 241–266. 313 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact