Characterizing finite Kripke structures in propositional temporal logic

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

E. M. Clarke, E. Allen Emerson, A. Prasad Sistla · ACM Transactions on Programming Languages and Systems · 1986 · 3.6K citations · Full text

Computing, Computer Science, Formal Methods +16

An Automata-Theoretic Approach to Automatic Program Verification

Moshe Y. Vardi, Pierre Wolper · ORBi (University of Liège) · 1986 · 1.3K citations · Full text

Computing, Computer Engineering, Computer Science +14

The complexity of propositional linear temporal logics

A. Prasad Sistla, E. M. Clarke · Journal of the ACM · 1985 · 1.1K citations · Full text

Humanities, Computer Science, Mathematics +12

“Sometimes” and “not never” revisited

E. Allen Emerson, Joseph Y. Halpern · Journal of the ACM · 1986 · 996 citations · Full text

Computing, Computer Science, Formal Methods +14

Checking that finite state concurrent programs satisfy their linear specification

Orna Lichtenstein, Amir Pnueli · 1985 · 619 citations · Full text

Computing, Computer Science, Algorithms +16