Thomas Genet
Thomas Genet
Univ Rennes, Inria, CNRS, IRISA
Verified email at - Homepage
Cited by
Cited by
Rewriting for cryptographic protocol verification
T Genet, F Klay
Automated Deduction-CADE-17: 17th International Conference on Automated …, 2000
Decidable approximations of sets of descendants and sets of normal forms
T Genet
Rewriting Techniques and Applications: 9th International Conference, RTA-98 …, 1998
Reachability analysis over term rewriting systems
G Feuillade, T Genet, V Viet Triem Tong
Journal of Automated Reasoning 33 (3-4), 341-383, 2004
Reachability analysis of term rewriting systems with timbuk
T Genet, VVT Tong
Logic for Programming, Artificial Intelligence, and Reasoning: 8th …, 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
Rewriting approximations for fast prototyping of static analyzers
Y Boichut, T Genet, T Jensen, L Le Roux
Term Rewriting and Applications: 18th International Conference, RTA 2007 …, 2007
Equational approximations for tree automata completion
T Genet, V Rusu
Journal of Symbolic Computation 45 (5), 574-597, 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
Span–a security protocol animator for avispa–user manual
Y Glouche, T Genet, E Houssay
IRISA/Université de Rennes 1, 20, 2006
A short span+ avispa tutorial
T Genet
IRISA, 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
Termination criteria for tree automata completion
T Genet
Journal of Logical and Algebraic Methods in Programming 85 (1), 3-33, 2016
Reachability in conditional term rewriting systems
G Feuillade, T Genet
Electronic Notes in Theoretical Computer Science 86 (1), 133-146, 2003
Towards an efficient implementation of tree automata completion
E Balland, Y Boichut, T Genet, PE Moreau
Lecture Notes in Computer Science 5140, 67-82, 2008
Certifying a tree automata completion checker
B Boyer, T Genet, T Jensen
Automated Reasoning: 4th International Joint Conference, IJCAR 2008 Sydney …, 2008
Reachability analysis of innermost rewriting
T Genet, Y Salmon
arXiv preprint arXiv:1610.05156, 2016
Equational Abstraction Refinement for Certified Tree Regular Model Checking.
Y Boichut, B Boyer, T Genet, A Legay
ICFEM 7635, 299-315, 2012
Rewriting for Cryptographic Protocol Verification-Extended Version
T Genet, F Klay
INRIA, 2000
Towards static analysis of functional programs using tree automata completion
T Genet
Rewriting Logic and Its Applications: 10th International Workshop, WRLA 2014 …, 2014
An industrial and academic joint experiment on automated verification of a security protocol
O Heen, T Genet, S Geller, N Prigent
Mobile and Wireless Networks Security, 39-53, 2008
The system can't perform the operation now. Try again later.
Articles 1–20