Using partial orders for the efficient verification of deadlock freedom and safety properties

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

Decidability of second-order theories and automata on infinite trees.

Michael O. Rabin · Transactions of the American Mathematical Society · 1969 · 1.2K citations · Full text

Computing, Computer Science, Mathematics +13

Checking that finite state concurrent programs satisfy their linear specification

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

Computing, Computer Science, Algorithms +16

Proving Liveness Properties of Concurrent Programs

Susan Owicki, Leslie Lamport · ACM Transactions on Programming Languages and Systems · 1982 · 583 citations · Full text

Computing, Computer Engineering, Computer Science +9