#### Filter Results:

- Full text PDF available (51)

#### Publication Year

1980

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (18)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- E. Allen Emerson
- Handbook of Theoretical Computer Science, Volumeâ€¦
- 1990

We give a comprehensive and unifying survey of the theoretical aspects of Temporal and Modal Logic Note This paper is to appear in the Handbook of Theoretical Computer Science J van Leeuwen managingâ€¦ (More)

- Edmund M. Clarke, E. Allen Emerson, A. Prasad Sistla
- ACM Trans. Program. Lang. Syst.
- 1986

We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algorithm has complexityâ€¦ (More)

- Edmund M. Clarke, E. Allen Emerson
- Logic of Programs
- 1981

We propose a method of constructing concurrent programs in which the synchronization skeleton of the program ~s automatically synthesized from a high-level (branching time) Temporal Logicâ€¦ (More)

- E. Allen Emerson, Joseph Y. Halpern
- J. ACM
- 1986

The differences between and appropriateness of branching versus linear time temporal logic for reasoning about concurrent programs are studied. These issues have been previously considered byâ€¦ (More)

- E. Allen Emerson, Joseph Y. Halpern
- STOC
- 1982

In this paper we consider the Computation Tree Logic (CTL) proposed in [CE] which extends the Unified Branching Time Logic (UB) of [BMP] by adding an <italic>until</italic> operator. We establishâ€¦ (More)

- E. Allen Emerson, Edmund M. Clarke
- Sci. Comput. Program.
- 1982

Astract. We present a method of constructing concurrent programs in which the synchronization skeleton of the program is automatically synthesized from a (branching time) temporal logicâ€¦ (More)

- E. Allen Emerson, Chin-Laung Lei
- LICS
- 1986

- E. Allen Emerson, Charanjit S. Jutla
- FOCS
- 1988

The complexity of testing nonemptiness of finite state automata on infinite trees is investigated. It is shown that for tree automata with the pairs (or complemented pairs) acceptance conditionâ€¦ (More)

- E. Allen Emerson, A. Prasad Sistla
- CAV
- 1993

\Whenever you have to do with a structure-endowed entity try to determine its group of automorphisms" Abstract We show how to exploit symmetry in model checking for concurrent systems containing manyâ€¦ (More)

- E. Allen Emerson, Chin-Laung Lei
- Sci. Comput. Program.
- 1987

We consider automatic verification of finite state concurrent programs. The global state graph of such a program can be viewed as a finite (Kripke) structure, and a model checking algorithm can beâ€¦ (More)