We present an automata-theoretic framework to the verification of concurrent and nondeterministic programs. The basic idea is that to verify that a program P is correct one writes a program A that receives the computation of P as input and diverges only on incorrect computations of P. Now P is correct if and only if a program PA, obtained by combining P and A, terminates. We formalize this idea in a framework of!-automata with a recursive set of states. This unifies previous works on verification of fair termination and verification of temporal properties. 1
|
1153
|
A Method of Programming
– Dijkstra, Feijen
- 1988
|
|
808
|
The temporal logic of programs
– Pnueli
- 1977
|
|
541
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
535
|
Theory of Recursive Functions and Effective Computability
– Rogers
- 1967
|
|
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
|
|
247
|
Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications
– Clarke, Emerson, et al.
- 1986
|
|
168
|
Automatic verification of probabilistic concurrent finite-state programs
– Vardi
- 1985
|
|
168
|
Temporal logic can be more expressive
– Wolper
- 1983
|
|
166
|
Temporal Logic
– Rescher, Urquhart
- 1971
|
|
124
|
Proving liveness properties of concurrent programs
– Owicki, Lamport
- 1982
|
|
116
|
Expressing interesting properties of programs in propositional temporal logic
– Wolper
- 1986
|
|
110
|
The temporal semantics of concurrent programs
– Pnueli
- 1981
|
|
103
|
On a decision method in restricted second-order arithmetic
– Büchi
- 1962
|
|
96
|
The complementation problem for Büchi automata with applications to temporal logic
– Sistla, Vardi, et al.
- 1985
|
|
64
|
Countable nondeterminism and random assignment
– Apt, Plotkin
- 1986
|
|
47
|
Checking that finite-state concurrent programs satisfy their linear specification
– Lichtenstein, Pnueli
- 1984
|
|
44
|
Theories of automata on !-tapes: A simplified approach
– Choueka
- 1974
|
|
43
|
Ten Years of Hoare Logic: a survey
– Apt
- 1981
|
|
43
|
How to Cook a Temporal Proof System for Your Pet Language
– Manna, Pnueli
- 1983
|
|
40
|
On the semantics of fair parallelism
– Park
- 1979
|
|
37
|
Verification of concurrent programs: a temporal proof system
– Manna, Pnueli
- 1983
|
|
35
|
Fairness and Related Properties in Transition Systems --- a Temporal Logic to Deal with Fairness
– Queille, Sifakis
- 1983
|
|
31
|
Specification and verification of concurrent programs by 8-automata
– Manna, Pnueli
- 1987
|
|
29
|
Propositional Dynamic Logic of Looping and Converse
– Streett
- 1982
|
|
19
|
Propositional dynamic logic of nonregular programs
– Harel, Pnueli, et al.
- 1983
|
|
17
|
Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness
– Harel
- 1986
|
|
16
|
Proving boolean combinations of deterministic properties
– Alpern, Schneider
- 1987
|
|
16
|
Reasoning about infinite computation paths
– Vardi, Wolper
- 1983
|
|
15
|
Modular verification of computer communication protocols
– Halpern, Owicki
- 1983
|
|
13
|
Proof rules and transformations dealing with fairness
– Apt, Olderog
- 1983
|
|
13
|
Verifying temporal properties without using temporal logic
– Alpern, Schneider
- 1985
|
|
9
|
A proof rule for fair termination of guarded commands
– Grumberg, Francez, et al.
- 1985
|
|
9
|
Hierarchies of recursive !-languages
– Staiger
- 1986
|
|
7
|
A weaker precondition for loops
– Boom
- 1982
|
|
6
|
fairness: the ethics of concurrent termination
– Lehman, Pnueli, et al.
- 1981
|
|
5
|
Proving precedence properties: the temporal way
– Manna, Pnueli
- 1983
|
|
4
|
Fair termination revisited with delay
– Apt, Pnueli, et al.
- 1984
|
|
4
|
Fair termination with cruel schedulers
– Dayan, Harel
- 1986
|
|
4
|
Infinite trees, markings and wellfoundedness
– Rinat, Francez, et al.
- 1988
|
|
3
|
On verifying that a concurrent program satisfies a nondeterministic specification
– Sistla
- 1989
|
|
1
|
A.: Adequate proof principles for invariance and liveness of concurrent programs
– Manna, Pnueli
|
|
1
|
A predicate transformer for weak fair termination
– Park
- 1981
|
|
1
|
Fairness, marked trees, and automata. Unpublished manuscript
– Sistla
- 1986
|
|
