Thomas Genet

34 papers A 2B 5C 3Journal 7Unranked 15
YearRankTypeTitle / Venue / Authors
2026 — conf
Complete Abstractions for Verification of Polymorphic Functions with Equality.
ESOP (2)
Malo Revel, Thomas Genet, Thomas P. Jensen
2025 — conf
Finding Regular Herbrand Models for CHCs using Answer Set Programming.
HCVS@CAV
Gregoire Maire, Thomas Genet
2024 B conf
Verification of Programs with ADTs Using Shallow Horn Clauses.
SAS
Théo Losekoot, Thomas Genet, Thomas P. Jensen
2023 B conf
Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures.
FSCD
Théo Losekoot, Thomas Genet, Thomas P. Jensen
2020 J jnl
Regular language type inference with term rewriting.
Proc. ACM Program. Lang.
Timothée Haudebourg, Thomas Genet, Thomas P. Jensen
2020 — conf
Termination of Ethereum's Smart Contracts.
ICETE (2)
Thomas Genet, Thomas P. Jensen, Justine Sauvage
2018 B conf
Completeness of Tree Automata Completion.
FSCD
Thomas Genet
2018 — conf
Extending Timbuk to Verify Functional Programs.
WRLA
Thomas Genet, Tristan Gillard, Timothée Haudebourg, Sébastien Lê Cong
2018 B conf
Verifying Higher-Order Functions with Tree Automata.
FoSSaCS
Thomas Genet, Timothée Haudebourg, Thomas P. Jensen
2017 — conf
GPFinder: Tracking the invisible in Android malware.
MALWARE
Mourad Leslous, Valérie Viet Triem Tong, Jean-François Lalande, Thomas Genet
2017 J jnl
Reachability Analysis of Innermost Rewriting.
Log. Methods Comput. Sci.
Thomas Genet, Yann Salmon
2016 J jnl
Termination criteria for tree automata completion.
J. Log. Algebraic Methods Program.
Thomas Genet
2015 — conf
Reachability Analysis of Innermost Rewriting.
RTA
Thomas Genet, Yann Salmon
2014 — conf
Towards Static Analysis of Functional Programs Using Tree Automata Completion.
WRLA
Thomas Genet
2014 J jnl
Towards Static Analysis of Functional Programs using Tree Automata Completion.
CoRR
Thomas Genet
2013 C conf
A Completion Algorithm for Lattice Tree Automata.
CIAA
Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat
2012 C conf
Equational Abstraction Refinement for Certified Tree Regular Model Checking.
ICFEM
Yohan Boichut, Benoît Boyer, Thomas Genet, Axel Legay
2012 J jnl
Tree Regular Model Checking for Lattice-Based Automata
CoRR
Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat
2010 J jnl
Equational approximations for tree automata completion.
J. Symb. Comput.
Thomas Genet, Vlad Rusu
2009 C conf
On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks.
WISTP
Olivier Heen, Gilles Guette, Thomas Genet
2009 — book
Reachability analysis of rewriting for software verification. (Analyse d'atteignabilité en réécriture pour la vérification de programmes).
Thomas Genet
2009 — conf
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems
RULE
Benoît Boyer, Thomas Genet
2008 A conf
Certifying a Tree Automata Completion Checker.
IJCAR
Benoît Boyer, Thomas Genet, Thomas P. Jensen
2008 — conf
Towards an Efficient Implementation of Tree Automata Completion.
AMAST
Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau
2007 — conf
Rewriting Approximations for Fast Prototyping of Static Analyzers.
RTA
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux
2006 — conf
Feasible Trace Reconstruction for Rewriting Approximations.
RTA
Yohan Boichut, Thomas Genet
2004 J jnl
Reachability Analysis over Term Rewriting Systems.
J. Autom. Reason.
Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong
2003 — conf
A Java Card CAP converter in PVS.
COCV
Thomas Genet, Thomas P. Jensen, Vikash Kodati, David Pichardie
2003 — conf
Reachability in Conditional Term Rewriting Systems.
FTP
Guillaume Feuillade, Thomas Genet
2001 B conf
Reachability Analysis of Term Rewriting Systems with Timbuk.
LPAR
Thomas Genet, Valérie Viet Triem Tong
2000 A conf
Rewriting for Cryptographic Protocol Verification.
CADE
Thomas Genet, Francis Klay
1998 — —
Contraintes d'ordre et automates d'arbres pour les preuves de terminaison. (Ordering constraints and tree automata for proving termination).
Thomas Genet
1998 — conf
Decidable Approximations of Sets of Descendants and Sets of Normal Forms.
RTA
Thomas Genet
1997 — conf
Termination Proofs Using gpo Ordering Constraints.
TAPSOFT
Thomas Genet, Isabelle Gnaedig