Thomas Genet

According to our database, Thomas Genet authored at least 29 papers between 1997 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures.

Théo Losekoot, Thomas Genet, Thomas P. Jensen

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2020

Regular language type inference with term rewriting.

Timothée Haudebourg, Thomas Genet, Thomas P. Jensen

Proc. ACM Program. Lang., 2020

Termination of Ethereum's Smart Contracts.

Thomas Genet, Thomas P. Jensen, Justine Sauvage

Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, 2020

2018

Extending Timbuk to Verify Functional Programs.

Thomas Genet, Tristan Gillard, Timothée Haudebourg, Sébastien Lê Cong

Proceedings of the Rewriting Logic and Its Applications - 12th International Workshop, 2018

Completeness of Tree Automata Completion.

Thomas Genet

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Verifying Higher-Order Functions with Tree Automata.

Thomas Genet, Timothée Haudebourg, Thomas P. Jensen

Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017

Reachability Analysis of Innermost Rewriting.

Thomas Genet, Yann Salmon

Log. Methods Comput. Sci., 2017

GPFinder: Tracking the invisible in Android malware.

Mourad Leslous, Valérie Viet Triem Tong, Jean-François Lalande, Thomas Genet

Proceedings of the 12th International Conference on Malicious and Unwanted Software, 2017

2016

Termination criteria for tree automata completion.

Thomas Genet

J. Log. Algebraic Methods Program., 2016

2014

Towards Static Analysis of Functional Programs Using Tree Automata Completion.

Thomas Genet

Proceedings of the Rewriting Logic and Its Applications - 10th International Workshop, 2014

2013

A Completion Algorithm for Lattice Tree Automata.

Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat

Proceedings of the Implementation and Application of Automata, 2013

2012

Tree Regular Model Checking for Lattice-Based Automata

Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat

CoRR, 2012

Equational Abstraction Refinement for Certified Tree Regular Model Checking.

Yohan Boichut, Benoît Boyer, Thomas Genet, Axel Legay

Proceedings of the Formal Methods and Software Engineering, 2012

2010

Equational approximations for tree automata completion.

Thomas Genet, Vlad Rusu

J. Symb. Comput., 2010

2009

Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems

Benoît Boyer, Thomas Genet

Proceedings of the Proceedings Tenth International Workshop on Rule-Based Programming, 2009

On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks.

Olivier Heen, Gilles Guette, Thomas Genet

Proceedings of the Information Security Theory and Practice. Smart Devices, 2009

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

Thomas Genet

, 2009

2008

Certifying a Tree Automata Completion Checker.

Benoît Boyer, Thomas Genet, Thomas P. Jensen

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

Towards an Efficient Implementation of Tree Automata Completion.

Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau

Proceedings of the Algebraic Methodology and Software Technology, 2008

2007

Rewriting Approximations for Fast Prototyping of Static Analyzers.

Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2006

Feasible Trace Reconstruction for Rewriting Approximations.

Yohan Boichut, Thomas Genet

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2004

Reachability Analysis over Term Rewriting Systems.

Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong

J. Autom. Reason., 2004

2003

A Java Card CAP converter in PVS.

Thomas Genet, Thomas P. Jensen, Vikash Kodati, David Pichardie

Proceedings of the Compiler Optimization Meets Compiler Verification, 2003

Reachability in Conditional Term Rewriting Systems.

Guillaume Feuillade, Thomas Genet

Proceedings of the 4th International Workshop on First-Order Theorem Proving, 2003

2001

Reachability Analysis of Term Rewriting Systems with Timbuk.

Thomas Genet, Valérie Viet Triem Tong

Proceedings of the Logic for Programming, 2001

2000

Rewriting for Cryptographic Protocol Verification.

Thomas Genet, Francis Klay

Proceedings of the Automated Deduction, 2000

1998

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

Thomas Genet

PhD thesis, 1998

Decidable Approximations of Sets of Descendants and Sets of Normal Forms.

Thomas Genet

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

1997

Termination Proofs Using gpo Ordering Constraints.

Thomas Genet, Isabelle Gnaedig

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997