Verification of complex systems cannot be achieved without combining several analysis methods and techniques. A widely adopted approach consists in combining abstraction methods with algorithmic verification techniques. Typically,
|
200
|
Reachability analysis of pushdown automata: Application to model-checking
– Bouajjani, Esparza, et al.
- 1997
|
|
98
|
A direct symbolic approach to model checking pushdown systems
– Finkel, Willems, et al.
- 1997
|
|
75
|
Regular model checking
– Bouajjani, Jonsson, et al.
- 2000
|
|
71
|
Symbolic verification of communication protocols with infinite state spaces using QDDs
– Boigelot, Godefroid
- 1996
|
|
68
|
Static determination of dynamic properties of recursive procedures
– Cousot, Cousot
- 1977
|
|
67
|
On the regular structure of prefix rewriting
– Caucal
- 1992
|
|
66
|
Symbolic verification with periodic sets
– Boigelot, Wolper
- 1994
|
|
64
|
Infinite results
– Moller
- 1996
|
|
58
|
On-the-fly analysis of systems with unbounded, lossy fifo channels
– Abdulla, Bouajjani, et al.
- 1998
|
|
55
|
General decidability theorems for infinite-state systems
– Abdulla, Cerans, et al.
- 1996
|
|
53
|
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
– Bouajjani, Habermehl
- 1999
|
|
51
|
The power of qdds
– Boigelot, Godefroid, et al.
- 1997
|
|
50
|
An automata-theoretic approach to interprocedural data-flow analysis
– Esparza, Knoop
- 1999
|
|
49
|
Unreliable channels are easier to verify than perfect channels
– Cécé, Finkel, et al.
- 1995
|
|
46
|
Transitive closures of regular relations for verifying infinite-state systems
– Jonsson, Nilsson
- 2000
|
|
42
|
Verifying systems with infinite but regular state spaces
– Wolper, Boigelot
- 1998
|
|
36
|
A BDD-based model checker for recursive programs
– Esparza, Schwoon
- 2001
|
|
35
|
The regular viewpoint on PA-processes
– Schnoebelen
- 1998
|
|
34
|
Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol
– Abdulla, Annichini, et al.
- 1999
|
|
31
|
TReX: A Tool for Reachability Analysis of Complex Systems
– Annichini, Bouajjani, et al.
- 2001
|
|
28
|
Decidability and Complexity of Model Checking Problems for Infinite-State Systems
– Mayr
- 1998
|
|
25
|
Undecidable Problems in Unreliable Computations
– Mayr
- 2000
|
|
21
|
Polynomial closure and unambiguous product
– Pin, Weil
- 1997
|
|
17
|
Reachability Sets of Parametrized Rings as Regular Languages
– Fribourg, Olsen
- 1997
|
|
13
|
Iterating transducers
– Dams, Lakhnech, et al.
- 2001
|
|
7
|
Permutation Rewriting and Algorithmic Verification
– Bouajjani, Muscholl, et al.
- 2001
|
|
6
|
Effective Lossy Queue Languages
– Abdulla, Boasson, et al.
- 2001
|
|
6
|
Well-abstracted transition systems
– Finkel, Iyer, et al.
- 2000
|
|
5
|
Liveness and acceleration in parametrized verification
– Pnueli, Shahar
- 2000
|
|
1
|
V'erification de R'eseaux Param'etr'es Bas'ee sur des Techniques de R'e'ecriture
– Touili
- 2000
|
|
