Подписаться
Alain Finkel
Alain Finkel
LMF ENS Paris Saclay
Подтвержден адрес электронной почты в домене ens-paris-saclay.fr - Главная страница
Название
Процитировано
Процитировано
Год
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
12312013
Well-structured transition systems everywhere!
A Finkel, P Schnoebelen
Theoretical Computer Science 256 (1-2), 63-92, 2001
9682001
Reset nets between decidability and undecidability
C Dufourd, A Finkel, P Schnoebelen
Automata, Languages and Programming: 25th International Colloquium, ICALP'98 …, 2006
3782006
On the verification of broadcast protocols
J Esparza, A Finkel, R Mayr
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
3701999
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
3061997
The minimal coverability graph for Petri nets
A Finkel
International Conference on Application and Theory of Petri Nets, 210-243, 1991
2761991
How to compose Presburger-accelerations: Applications to broadcast protocols
A Finkel, J Leroux
FSTTCS 2, 145-156, 2002
2182002
Unreliable channels are easier to verify than perfect channels
G Cécé, A Finkel, SP Iyer
Information and Computation 124 (1), 20-31, 1996
1801996
Fast: Fast acceleration of symbolic transition systems
S Bardin, A Finkel, J Leroux, L Petrucci
Computer Aided Verification: 15th International Conference, CAV 2003 …, 2003
1712003
Reduction and covering of infinite reachability trees
A Finkel
Information and Computation 89 (2), 144-179, 1990
1451990
Verification of programs with half-duplex communication
G Cécé, A Finkel
Information and Computation 202 (2), 166-190, 2005
1172005
Flat acceleration in symbolic model checking
S Bardin, A Finkel, J Leroux, P Schnoebelen
Automated Technology for Verification and Analysis: Third International …, 2005
1142005
A generalization of the procedure of Karp and Miller to well structured transition systems
A Finkel
Automata, Languages and Programming: 14th International Colloquium Karlsruhe …, 1987
1091987
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
1062008
Forward analysis for WSTS, part I: Completions
A Finkel, J Goubault-Larrecq
arXiv preprint arXiv:0902.1587, 2009
1052009
Decidability of the termination problem for completely specified protocols
A Finkel
Distributed Computing 7 (3), 129-135, 1994
1041994
Forward Analysis for WSTS, Part II: Complete WSTS
A Finkel, J Goubault-Larrecq
Logical Methods in Computer Science 8, 2012
992012
Forward analysis for WSTS, part II: Complete WSTS
A Finkel, J Goubault-Larrecq
International Colloquium on Automata, Languages, and Programming, 188-199, 2009
992009
A well-structured framework for analysing Petri net extensions
A Finkel, P McKenzie, C Picaronny
Information and Computation 195 (1-2), 1-29, 2004
822004
Reachability in two-dimensional vector addition systems with states is PSPACE-complete
M Blondin, A Finkel, S Göller, C Haase, P McKenzie
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 32-43, 2015
802015
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20