Thomas Genet

	2009
12		Olivier Heen, Gilles Guette, Thomas Genet: On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks. WISTP 2009: 1-11
	2008
11		Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau: Towards an Efficient Implementation of Tree Automata Completion. AMAST 2008: 67-82
10		Benoît Boyer, Thomas Genet, Thomas P. Jensen: Certifying a Tree Automata Completion Checker. IJCAR 2008: 523-538
	2007
9		Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux: Rewriting Approximations for Fast Prototyping of Static Analyzers. RTA 2007: 48-62
	2006
8		Yohan Boichut, Thomas Genet: Feasible Trace Reconstruction for Rewriting Approximations. RTA 2006: 123-135
	2004
7		Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong: Reachability Analysis over Term Rewriting Systems. J. Autom. Reasoning 33(3-4): 341-383 (2004)
	2003
6		Thomas Genet, Thomas P. Jensen, Vikash Kodati, David Pichardie: A Java Card CAP converter in PVS. Electr. Notes Theor. Comput. Sci. 82(2): (2003)
5		Guillaume Feuillade, Thomas Genet: Reachability in Conditional Term Rewriting Systems. Electr. Notes Theor. Comput. Sci. 86(1): (2003)
	2001
4		Thomas Genet, Valérie Viet Triem Tong: Reachability Analysis of Term Rewriting Systems with Timbuk. LPAR 2001: 695-706
	2000
3		Thomas Genet, Francis Klay: Rewriting for Cryptographic Protocol Verification. CADE 2000: 271-290
	1998
2		Thomas Genet: Decidable Approximations of Sets of Descendants and Sets of Normal Forms. RTA 1998: 151-165
	1997
1		Thomas Genet, Isabelle Gnaedig: Termination Proofs Using gpo Ordering Constraints. TAPSOFT 1997: 249-260

Coauthor Index

1	Emilie Balland	[11]
2	Yohan Boichut	[8] [9] [11]
3	Benoît Boyer	[10]
4	Guillaume Feuillade	[5] [7]
5	Isabelle Gnaedig	[1]
6	Gilles Guette	[12]
7	Olivier Heen	[12]
8	Thomas P. Jensen	[6] [9] [10]
9	Francis Klay	[3]
10	Vikash Kodati	[6]
11	Pierre-Etienne Moreau	[11]
12	David Pichardie	[6]
13	Luka Le Roux	[9]
14	Valérie Viet Triem Tong	[4] [7]

Colors in the list of coauthors