| Rewriting for cryptographic protocol verification T Genet, F Klay International Conference on Automated Deduction, 271-290, 2000 | 215 | 2000 |
| Decidable approximations of sets of descendants and sets of normal forms T Genet International Conference on Rewriting Techniques and Applications, 151-165, 1998 | 145 | 1998 |
| Reachability analysis over term rewriting systems G Feuillade, T Genet, V Viet Triem Tong Journal of Automated Reasoning 33 (3), 341-383, 2004 | 140 | 2004 |
| Reachability analysis of term rewriting systems with timbuk T Genet, VVT Tong International Conference on Logic for Programming Artificial Intelligence …, 2001 | 90 | 2001 |
| A security protocol animator tool for AVISPA Y Glouche, T Genet, O Heen, O Courtay ARTIST2 workshop on security specification and verification of embedded …, 2006 | 81 | 2006 |
| Rewriting approximations for fast prototyping of static analyzers Y Boichut, T Genet, T Jensen, L Le Roux International Conference on Rewriting Techniques and Applications, 48-62, 2007 | 72 | 2007 |
| Equational approximations for tree automata completion T Genet, V Rusu Journal of Symbolic Computation 45 (5), 574-597, 2010 | 53 | 2010 |
| Verification of copy-protection cryptographic protocol using approximations of term rewriting systems T Genet Proc. of Workshop on Issues in the Theory of Security (WITS'03), 2003 | 42 | 2003 |
| A short span+ avispa tutorial T Genet IRISA, 2015 | 31 | 2015 |
| Using animation to improve formal specifications of security protocols Y Boichut, T Genet, Y Glouche, O Heen 2nd Conference on Security in Network Architectures and Information Systems …, 2007 | 29 | 2007 |
| Span–a security protocol animator for avispa–user manual Y Glouche, T Genet, E Houssay IRISA/Université de Rennes 1, 20, 2006 | 29 | 2006 |
| Termination criteria for tree automata completion T Genet Journal of Logical and Algebraic Methods in Programming 85 (1), 3-33, 2016 | 21 | 2016 |
| Reachability in conditional term rewriting systems G Feuillade, T Genet Electronic Notes in Theoretical Computer Science 86 (1), 133-146, 2003 | 21 | 2003 |
| Towards an efficient implementation of tree automata completion E Balland, Y Boichut, T Genet, PE Moreau International Conference on Algebraic Methodology and Software Technology, 67-82, 2008 | 19 | 2008 |
| Regular language type inference with term rewriting T Haudebourg, T Genet, T Jensen Proceedings of the ACM on Programming Languages 4 (ICFP), 1-29, 2020 | 17 | 2020 |
| Rewriting for Cryptographic Protocol Verification-Extended Version T Genet, F Klay INRIA, 2000 | 17 | 2000 |
| Certifying a tree automata completion checker B Boyer, T Genet, T Jensen International Joint Conference on Automated Reasoning, 523-538, 2008 | 16 | 2008 |
| Reachability analysis of innermost rewriting T Genet, Y Salmon Logical Methods in Computer Science 13, 2017 | 15 | 2017 |
| Reachability analysis of rewriting for software verification T Genet Université Rennes 1, 2009 | 15 | 2009 |
| Termination of Ethereum's smart contracts T Genet, T Jensen, J Sauvage Univ Rennes, Inria, CNRS, IRISA, 2020 | 14 | 2020 |
Valerie Viet Triem TongCENTRALESUPELECcentralesupelec.fr의 이메일 확인됨
