vardi Abstract. We describe an automata-theoretic approach to the automatic verification of finite-state programs. The basic idea underlying this approach is that for any temporal formula we can construct an alternating automaton that accepts precisely the computations that satisfy the formula. For linear temporal logics the automaton runs on infinite words while for branching temporal logics the automaton runs on infinite trees. The simple combinatorial structures that emerge from the automata-theoretic approach decouple the logical and algorithmic components of finite-state-program verification and yield clear and general verification algorithms. 1
|
1345
|
A.: The Temporal Logic of Reactive and Concurrent Systems
– Manna, Pnueli
- 1992
|
|
996
|
Automatic verification of finite-state concurrent systems using temporal logic specifications
– Clarke, Emerson, et al.
- 1986
|
|
909
|
Temporal and modal logic
– Emerson
- 1990
|
|
808
|
The temporal logic of programs
– Pnueli
- 1977
|
|
460
|
P.: An automata-theoretic approach to automatic program verification
– Vardi, Wolper
- 1986
|
|
248
|
E.: The complexity of propositional linear temporal logic
– Sistla, Clarke
- 1985
|
|
212
|
A.: Checking that finite state concurrent programs satisfy their linear specification
– Lichtenstein, Pnueli
- 1985
|
|
210
|
P.: An automata-theoretic approach to branching-time model checking
– Bernholtz, Vardi, et al.
- 1994
|
|
182
|
Reasoning about infinite computations
– Vardi, Wolper
- 1994
|
|
178
|
Specification and verification of concurrent systems in Cesar
– Queille, Sifakis
- 1982
|
|
164
|
Automata-theoretic techniques for modal logics of programs
– Vardi, Wolper
- 1986
|
|
155
|
Tree automata, mu-calculus and determinacy (Extended abstract
– Emerson, Jutla
- 1991
|
|
125
|
The complexity of tree automata and logics of programs
– Emerson, Jutla
- 1988
|
|
115
|
The glory of the past
– Lichtenstein, Pnueli, et al.
- 1985
|
|
111
|
Verification tools for finite-state concurrent systems
– Clarke, Grumberg, et al.
- 1994
|
|
104
|
A linear-time model-checking algorithm for the alternation-free modal mu-calculus. CAV’91
– Cleaveland, Steffen
|
|
102
|
Memory efficient algorithms for the verification of temporal properties Formal Methods
– Courcoubetis, Wolper, et al.
- 1992
|
|
96
|
The complementation problem for Büchi automata with applications to temporal logic
– Sistla, Vardi, et al.
- 1985
|
|
67
|
Modalities for model checking: branching time logic strikes back
– Emerson, Lei
- 1987
|
|
62
|
Reasoning about infinite computation paths
– Wolper, Vardi, et al.
- 1983
|
|
57
|
and P.E.Schupp. Alternating automata on infinite trees
– Muller
- 1987
|
|
54
|
On the Relation of Programs and Computations to Models of Temporal Logic
– Wolper
- 1989
|
|
49
|
Avoiding the state explosion problem in temporal logic model checking algorithms
– Clarke, Grumberg
- 1987
|
|
44
|
Theories of automata on !-tapes: A simplified approach
– Choueka
- 1974
|
|
44
|
Alternating automata. The weak monadic theory of the tree, and its complexity
– Muller, Saoudi, et al.
- 1986
|
|
35
|
Sometimes is sometimes "not never" - on the temporal logic of programs
– Lamport
- 1980
|
|
33
|
Simulating alternating tree automata by nondeterministic automata: new results and new proofs of theorems of
– Muller, Schupp
- 1995
|
|
30
|
Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time
– Muller, Saoudi, et al.
- 1988
|
|
24
|
Temporal model checking under generalized fairness constraints
– Emerson, Lei
- 1985
|
|
23
|
Complementation is more difficult with automata on infinite words
– Michel
- 1988
|
|
22
|
Deciding Branching Time Logic
– Emerson, Sistla
- 1984
|
|
21
|
Protocol engineering
– Liu
- 1989
|
|
20
|
Finite automata and sequential networks
– Brzozowski, Leiss
- 1980
|
|
20
|
On the complexity of omega-automata
– Safra
- 1988
|
|
18
|
Nontraditional applications of automata theory
– Vardi
- 1994
|
|
16
|
Alternating finite automata on !-words
– Miyano, Hayashi
- 1984
|
|
13
|
temporal logics
– Automata
- 1985
|
|
8
|
Network protocols and tools to help produce them
– Rudin
- 1987
|
|
8
|
The propositional mu-calculus is elementary
– Streett, Emerson
- 1984
|
|
6
|
Definable Relations and Special Automata
– Weakly
- 1970
|
|
5
|
Theoretical issues in the design and analysis of distributed systems
– Sistla
- 1983
|
|
4
|
regular languages and propositional temporal logic
– Peikert
- 1985
|
|
