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
International Conference on Automated Deduction, 271-290, 2000
Decidable approximations of sets of descendants and sets of normal forms
T Genet
International Conference on Rewriting Techniques and Applications, 151-165, 1998
Reachability analysis over term rewriting systems
G Feuillade, T Genet, VVT Tong
Journal of Automated Reasoning 33 (3), 341-383, 2004
Reachability analysis of term rewriting systems with timbuk
T Genet, VVT Tong
International Conference on Logic for Programming Artificial Intelligence …, 2001
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
Equational approximations for tree automata completion
T Genet, V Rusu
Journal of Symbolic Computation 45 (5), 574-597, 2010
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
Verification of copy-protection cryptographic protocol using approximations of term rewriting systems
T Genet, YM Tang-Talpin, VVT Tong
Span–a security protocol animator for avispa–user manual
Y Glouche, T Genet, E Houssay
IRISA/Université de Rennes 1, 20, 2006
Reachability in conditional term rewriting systems
G Feuillade, T Genet
Electronic Notes in Theoretical Computer Science 86 (1), 133-146, 2003
Termination criteria for tree automata completion
T Genet
Journal of Logical and Algebraic Methods in Programming 85 (1), 3-33, 2016
Reachability analysis of innermost rewriting
T Genet, Y Salmon
arXiv preprint arXiv:1610.05156, 2016
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
Rewriting for Cryptographic Protocol Verification-Extended Version
T Genet, F Klay
INRIA, 2000
Equational abstraction refinement for certified tree regular model checking
Y Boichut, B Boyer, T Genet, A Legay
International Conference on Formal Engineering Methods, 299-315, 2012
Certifying a tree automata completion checker
B Boyer, T Genet, T Jensen
International Joint Conference on Automated Reasoning, 523-538, 2008
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
A short span+ avispa tutorial
T Genet
IRISA, 2015
Feasible trace reconstruction for rewriting approximations
Y Boichut, T Genet
International Conference on Rewriting Techniques and Applications, 123-135, 2006
Termination proofs using gpo ordering constraints
T Genet, I Gnaedig
Colloquium on Trees in Algebra and Programming, 249-260, 1997
The system can't perform the operation now. Try again later.
Articles 1–20