I, the undersigned, hereby declare that the work contained in this thesis is my own original work and that I have not previously in its entirety or in part submitted it at any university for a degree.
|
2677
|
Communicating Sequential Processes
– Hoare
- 1995
|
|
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
|
|
714
|
Design and Validation of Computer Protocols
– Holzmann
- 1991
|
|
568
|
Design and synthesis of synchronization skeletons using branching time temporal logic
– Clarke, Emerson
- 1981
|
|
460
|
P.: An automata-theoretic approach to automatic program verification
– Vardi, Wolper
- 1986
|
|
387
|
Automata on infinite objects
– Thomas
- 1990
|
|
241
|
On a decision method in restricted second order arithmetic
– Büchi
- 1962
|
|
228
|
Proving the correctness of multiprocess programs
– Lamport
- 1977
|
|
210
|
P.: An automata-theoretic approach to branching-time model checking
– Bernholtz, Vardi, et al.
- 1994
|
|
207
|
Simple on-the-fly automatic verification of linear temporal logic
– Gerth, Peled, et al.
- 1995
|
|
182
|
Reasoning about infinite computations
– Vardi, Wolper
- 1994
|
|
178
|
Specification and verification of concurrent systems in Cesar
– Queille, Sifakis
- 1982
|
|
154
|
An automata-theoretic approach to linear temporal logic
– Vardi
- 1995
|
|
102
|
Memory efficient algorithms for the verification of temporal properties Formal Methods
– Courcoubetis, Wolper, et al.
- 1992
|
|
99
|
Decidability of second order theories and automata on infinite trees
– Rabin
- 1969
|
|
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
|
|
67
|
Testing and generating infinite sequences by a finite automaton
– McNaughton
- 1966
|
|
45
|
Efficient On-the-fly Model Checking for CTL
– Bhat, Cleaveland, et al.
- 1995
|
|
45
|
On nested depth first search
– Holzmann, Peled, et al.
- 1996
|
|
35
|
Sometimes is sometimes "not never" - on the temporal logic of programs
– Lamport
- 1980
|
|
34
|
Automated temporal reasoning about reactive systems. Logics for Concurrency: Structure versus Automata
– Emerson
- 1996
|
|
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
|
|
27
|
Weak alternating automata and tree automata emptiness
– Kupferman, Vardi
- 1998
|
|
9
|
T.: On-the-fly verification of finite transition systems
– Fernandez, Mounier, et al.
- 1992
|
|
8
|
A linear local model checking algorithm for CTL
– Vergauwen, Lewi
- 1993
|
|
6
|
A Model Checker for Linear Time Temporal Logic
– Fisher
- 1992
|
|
5
|
ESML---a validation language for concurrent systems
– Villiers, Visser
- 1992
|
|
1
|
Providing mechanical support for program development in a weakest precondition calculus
– Ackerman
- 1993
|
|
