팔로우
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
12322013
Well-structured transition systems everywhere!
A Finkel, P Schnoebelen
Theoretical Computer Science 256 (1-2), 63-92, 2001
9382001
Reset nets between decidability and undecidability
C Dufourd, A Finkel, P Schnoebelen
Automata, Languages and Programming: 25th International Colloquium, ICALP'98 …, 2006
3722006
On the verification of broadcast protocols
J Esparza, A Finkel, R Mayr
Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999
3571999
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
3051997
The minimal coverability graph for Petri nets
A Finkel
International Conference on Application and Theory of Petri Nets, 210-243, 1991
2751991
How to compose Presburger-accelerations: Applications to broadcast protocols
A Finkel, J Leroux
FSTTCS 2, 145-156, 2002
2152002
Unreliable channels are easier to verify than perfect channels
G Cécé, A Finkel, SP Iyer
Information and Computation 124 (1), 20-31, 1996
1771996
Fast: Fast acceleration of symbolic transition systems
S Bardin, A Finkel, J Leroux, L Petrucci
Computer Aided Verification: 15th International Conference, CAV 2003 …, 2003
1692003
Reduction and covering of infinite reachability trees
A Finkel
Information and Computation 89 (2), 144-179, 1990
1411990
Verification of programs with half-duplex communication
G Cécé, A Finkel
Information and Computation 202 (2), 166-190, 2005
1122005
Flat acceleration in symbolic model checking
S Bardin, A Finkel, J Leroux, P Schnoebelen
Automated Technology for Verification and Analysis: Third International …, 2005
1102005
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
1081987
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
1022008
Decidability of the termination problem for completely specified protocols
A Finkel
Distributed Computing 7 (3), 129-135, 1994
1011994
Forward analysis for WSTS, part I: Completions
A Finkel, J Goubault-Larrecq
arXiv preprint arXiv:0902.1587, 2009
1002009
Forward Analysis for WSTS, Part II: Complete WSTS
A Finkel, J Goubault-Larrecq
Logical Methods in Computer Science 8, 2012
952012
Forward analysis for WSTS, part II: Complete WSTS
A Finkel, J Goubault-Larrecq
International Colloquium on Automata, Languages, and Programming, 188-199, 2009
952009
A well-structured framework for analysing Petri net extensions
A Finkel, P McKenzie, C Picaronny
Information and Computation 195 (1-2), 1-29, 2004
802004
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
752015
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20