| 2026 | ESOP | Complete Abstractions for Verification of Polymorphic Functions with Equality. | Malo Revel, Thomas Genet, Thomas P. Jensen |
| 2024 | SAS | Verification of Programs with ADTs Using Shallow Horn Clauses. | Tho Losekoot, Thomas Genet, Thomas P. Jensen |
| 2023 | FSCD | Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures. | Tho Losekoot, Thomas Genet, Thomas P. Jensen |
| 2018 | FOSSACS | Verifying Higher-Order Functions with Tree Automata. | Thomas Genet, Timothe Haudebourg, Thomas P. Jensen |
| 2012 | ICFEM | Equational Abstraction Refinement for Certified Tree Regular Model Checking. | Yohan Boichut, Benot Boyer, Thomas Genet, Axel Legay |
| 2009 | WISTP | On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks. | Olivier Heen, Gilles Guette, Thomas Genet |
| 2008 | CADE | Certifying a Tree Automata Completion Checker. | Benot Boyer, Thomas Genet, Thomas P. Jensen |
| 2001 | LPAR | Reachability Analysis of Term Rewriting Systems with Timbuk. | Thomas Genet, Valrie Viet Triem Tong |
| 2000 | CADE | Rewriting for Cryptographic Protocol Verification. | Thomas Genet, Francis Klay |