Thomas Genet

Publication Activity (10 Years)

Years Active: 1997-2023
Publications (10 Years): 9

Top Topics

Reachability Analysis

Functional Programs

Top Venues

Proc. ACM Program. Lang.

J. Log. Algebraic Methods Program.

Publications

Théo Losekoot, Thomas Genet, Thomas P. Jensen
Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures. FSCD (2023)
Thomas Genet, Thomas P. Jensen, Justine Sauvage
Termination of Ethereum's Smart Contracts. ICETE (2) (2020)
Timothée Haudebourg, Thomas Genet, Thomas P. Jensen
Regular language type inference with term rewriting. Proc. ACM Program. Lang. 4 (ICFP) (2020)
Thomas Genet, Timothée Haudebourg, Thomas P. Jensen
Verifying Higher-Order Functions with Tree Automata. FoSSaCS (2018)
Thomas Genet, Tristan Gillard, Timothée Haudebourg, Sébastien Lê Cong
Extending Timbuk to Verify Functional Programs. WRLA@ETAPS (2018)
Thomas Genet
Completeness of Tree Automata Completion. FSCD (2018)
Mourad Leslous, Valérie Viet Triem Tong, Jean-François Lalande, Thomas Genet
GPFinder: Tracking the invisible in Android malware. MALWARE (2017)
Thomas Genet, Yann Salmon
Reachability Analysis of Innermost Rewriting. Log. Methods Comput. Sci. 13 (1) (2017)
Thomas Genet
Termination criteria for tree automata completion. J. Log. Algebraic Methods Program. 85 (1) (2016)
Thomas Genet, Yann Salmon
Reachability Analysis of Innermost Rewriting. RTA (2015)
Thomas Genet
Towards Static Analysis of Functional Programs using Tree Automata Completion. CoRR (2014)
Thomas Genet
Towards Static Analysis of Functional Programs Using Tree Automata Completion. WRLA (2014)
Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat
A Completion Algorithm for Lattice Tree Automata. CIAA (2013)
Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat
Tree Regular Model Checking for Lattice-Based Automata CoRR (2012)
Yohan Boichut, Benoît Boyer, Thomas Genet, Axel Legay
Equational Abstraction Refinement for Certified Tree Regular Model Checking. ICFEM (2012)
Thomas Genet, Vlad Rusu
Equational approximations for tree automata completion. J. Symb. Comput. 45 (5) (2010)
Benoît Boyer, Thomas Genet
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems RULE (2009)
Olivier Heen, Gilles Guette, Thomas Genet
On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks. WISTP (2009)
Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau
Towards an Efficient Implementation of Tree Automata Completion. AMAST (2008)
Benoît Boyer, Thomas Genet, Thomas P. Jensen
Certifying a Tree Automata Completion Checker. IJCAR (2008)
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux
Rewriting Approximations for Fast Prototyping of Static Analyzers. RTA (2007)
Yohan Boichut, Thomas Genet
Feasible Trace Reconstruction for Rewriting Approximations. RTA (2006)
Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong
Reachability Analysis over Term Rewriting Systems. J. Autom. Reason. 33 (3-4) (2004)
Thomas Genet, Thomas P. Jensen, Vikash Kodati, David Pichardie
A Java Card CAP converter in PVS. Electron. Notes Theor. Comput. Sci. 82 (2) (2003)
Guillaume Feuillade, Thomas Genet
Reachability in Conditional Term Rewriting Systems. Electron. Notes Theor. Comput. Sci. 86 (1) (2003)
Thomas Genet, Valérie Viet Triem Tong
Reachability Analysis of Term Rewriting Systems with Timbuk. LPAR (2001)
Thomas Genet, Francis Klay
Rewriting for Cryptographic Protocol Verification. CADE (2000)
Thomas Genet
Decidable Approximations of Sets of Descendants and Sets of Normal Forms. RTA (1998)
Thomas Genet, Isabelle Gnaedig
Termination Proofs Using gpo Ordering Constraints. TAPSOFT (1997)