Alain Finkel
Título
Citado por
Citado por
Año
Systems and software verification: model-checking techniques and tools
B Bérard, M Bidoit, A Finkel, F Laroussinie, A Petit, L Petrucci, ...
Springer Science & Business Media, 2013
10822013
Well-structured transition systems everywhere!
A Finkel, P Schnoebelen
Theoretical Computer Science 256 (1-2), 63-92, 2001
8192001
Reset nets between decidability and undecidability
C Dufourd, A Finkel, P Schnoebelen
International Colloquium on Automata, Languages, and Programming, 103-115, 1998
3261998
On the verification of broadcast protocols
J Esparza, A Finkel, R Mayr
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
3111999
On the verification of broadcast protocols
J Esparza, A Finkel, R Mayr
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
3111999
A direct symbolic approach to model checking pushdown systems
A Finkel, B Willems, P Wolper
Electronic Notes in Theoretical Computer Science 9, 27-37, 1997
2681997
The minimal coverability graph for Petri nets
A Finkel
International Conference on Application and Theory of Petri Nets, 210-243, 1991
2321991
How to compose Presburger-accelerations: Applications to broadcast protocols
A Finkel, J Leroux
FSTTCS 2, 145-156, 2002
1982002
Unreliable channels are easier to verify than perfect channels
G Cécé, A Finkel, SP Iyer
Information and Computation 124 (1), 20-31, 1996
1681996
Fast: Fast acceleration of symbolic transition systems
S Bardin, A Finkel, J Leroux, L Petrucci
International Conference on Computer Aided Verification, 118-121, 2003
1482003
Reduction and covering of infinite reachability trees
A Finkel
Information and Computation 89 (2), 144-179, 1990
1321990
Decidability of the termination problem for completely specified protocols
A Finkel
Distributed Computing 7 (3), 129-135, 1994
971994
Flat acceleration in symbolic model checking
S Bardin, A Finkel, J Leroux, P Schnoebelen
International Symposium on Automated Technology for Verification and …, 2005
962005
A generalization of the procedure of Karp and Miller to well structured transition systems
A Finkel
International Colloquium on Automata, Languages, and Programming, 499-508, 1987
921987
Forward analysis for WSTS, part I: Completions
A Finkel, J Goubault-Larrecq
arXiv preprint arXiv:0902.1587, 2009
912009
Verification of programs with half-duplex communication
G Cécé, A Finkel
Information and Computation 202 (2), 166-190, 2005
912005
Forward analysis for WSTS, part II: Complete WSTS
A Finkel, J Goubault-Larrecq
International Colloquium on Automata, Languages, and Programming, 188-199, 2009
832009
FAST: acceleration from theory to practice
S Bardin, A Finkel, J Leroux, L Petrucci
International Journal on Software Tools for Technology Transfer (STTT) 10 (5 …, 2008
782008
A well-structured framework for analysing Petri net extensions
A Finkel, P McKenzie, C Picaronny
Information and Computation 195 (1-2), 1-29, 2004
712004
FASTer acceleration of counter automata in practice
S Bardin, A Finkel, J Leroux
TACAS 4, 576-590, 2004
672004
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20