Termination Proofs Using gpo Ordering Constraints. - Thomas Genet; Isabelle Gnaedig (TAPSOFT, 1997)

Decidable Approximations of Sets of Descendants and Sets of Normal Forms. - Thomas Genet (RTA, 1998)

Contraintes d'ordre et automates d'arbres pour les preuves de terminaison. (Ordering constraints and tree automata for proving termination). - Thomas Genet (1998)

Rewriting for Cryptographic Protocol Verification. - Thomas Genet; Francis Klay (CADE, 2000)

Reachability Analysis of Term Rewriting Systems with Timbuk. - Thomas Genet; Valérie Viet Triem Tong (LPAR, 2001)

Reachability in Conditional Term Rewriting Systems. - Guillaume Feuillade; Thomas Genet (FTP, 2003)

A Java Card CAP converter in PVS. - Thomas Genet; Thomas P. Jensen; Vikash Kodati; David Pichardie (COCV@ETAPS, 2003)

Reachability Analysis over Term Rewriting Systems. - Guillaume Feuillade; Thomas Genet; Valérie Viet Triem Tong (J. Autom. Reason., 2004)

Feasible Trace Reconstruction for Rewriting Approximations. - Yohan Boichut; Thomas Genet (RTA, 2006)

Rewriting Approximations for Fast Prototyping of Static Analyzers. - Yohan Boichut; Thomas Genet; Thomas P. Jensen; Luka Le Roux (RTA, 2007)

Towards an Efficient Implementation of Tree Automata Completion. - Emilie Balland; Yohan Boichut; Thomas Genet; Pierre-Etienne Moreau (AMAST, 2008)

Certifying a Tree Automata Completion Checker. - Benoît Boyer; Thomas Genet; Thomas P. Jensen (IJCAR, 2008)

Reachability analysis of rewriting for software verification. (Analyse d'atteignabilité en réécriture pour la vérification de programmes). - Thomas Genet (2009)

On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks. - Olivier Heen; Gilles Guette; Thomas Genet (WISTP, 2009)

Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems - Benoît Boyer; Thomas Genet (RULE, 2009)

Equational approximations for tree automata completion. - Thomas Genet; Vlad Rusu (J. Symb. Comput., 2010)

Equational Abstraction Refinement for Certified Tree Regular Model Checking. - Yohan Boichut; Benoît Boyer; Thomas Genet; Axel Legay (ICFEM, 2012)

Tree Regular Model Checking for Lattice-Based Automata - Thomas Genet; Tristan Le Gall; Axel Legay; Valérie Murat (CoRR, 2012)

A Completion Algorithm for Lattice Tree Automata. - Thomas Genet; Tristan Le Gall; Axel Legay; Valérie Murat (CIAA, 2013)

Towards Static Analysis of Functional Programs Using Tree Automata Completion. - Thomas Genet (WRLA, 2014)

Termination criteria for tree automata completion. - Thomas Genet (J. Log. Algebraic Methods Program., 2016)

GPFinder: Tracking the invisible in Android malware. - Mourad Leslous; Valérie Viet Triem Tong; Jean-François Lalande; Thomas Genet (MALWARE, 2017)

Reachability Analysis of Innermost Rewriting. - Thomas Genet; Yann Salmon 001 (Log. Methods Comput. Sci., 2017)

Verifying Higher-Order Functions with Tree Automata. - Thomas Genet; Timothée Haudebourg; Thomas P. Jensen (FoSSaCS, 2018)

Completeness of Tree Automata Completion. - Thomas Genet (FSCD, 2018)

Extending Timbuk to Verify Functional Programs. - Thomas Genet; Tristan Gillard; Timothée Haudebourg; Sébastien Lê Cong (WRLA@ETAPS, 2018)

Termination of Ethereum's Smart Contracts. - Thomas Genet; Thomas P. Jensen; Justine Sauvage (ICETE (2), 2020)

Regular language type inference with term rewriting. - Timothée Haudebourg; Thomas Genet; Thomas P. Jensen (Proc. ACM Program. Lang., 2020)

Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures. - Théo Losekoot; Thomas Genet; Thomas P. Jensen (FSCD, 2023)

Verification of Programs with ADTs Using Shallow Horn Clauses. - Théo Losekoot; Thomas Genet; Thomas P. Jensen (SAS, 2024)