Thomas Genet

According to our database1, Thomas Genet authored at least 28 papers between 1997 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Regular language type inference with term rewriting.
Proc. ACM Program. Lang., 2020

Termination of Ethereum's Smart Contracts.
Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, 2020

2018
Extending Timbuk to Verify Functional Programs.
Proceedings of the Rewriting Logic and Its Applications - 12th International Workshop, 2018

Completeness of Tree Automata Completion.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Verifying Higher-Order Functions with Tree Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
Reachability Analysis of Innermost Rewriting.
Log. Methods Comput. Sci., 2017

GPFinder: Tracking the invisible in Android malware.
Proceedings of the 12th International Conference on Malicious and Unwanted Software, 2017

2016
Termination criteria for tree automata completion.
J. Log. Algebraic Methods Program., 2016

2014
Towards Static Analysis of Functional Programs Using Tree Automata Completion.
Proceedings of the Rewriting Logic and Its Applications - 10th International Workshop, 2014

2013
A Completion Algorithm for Lattice Tree Automata.
Proceedings of the Implementation and Application of Automata, 2013

2012
Tree Regular Model Checking for Lattice-Based Automata
CoRR, 2012

Equational Abstraction Refinement for Certified Tree Regular Model Checking.
Proceedings of the Formal Methods and Software Engineering, 2012

2010
Equational approximations for tree automata completion.
J. Symb. Comput., 2010

2009
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems
Proceedings of the Proceedings Tenth International Workshop on Rule-Based Programming, 2009

On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks.
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).
, 2009

2008
Certifying a Tree Automata Completion Checker.
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

Towards an Efficient Implementation of Tree Automata Completion.
Proceedings of the Algebraic Methodology and Software Technology, 2008

2007
Rewriting Approximations for Fast Prototyping of Static Analyzers.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2006
Feasible Trace Reconstruction for Rewriting Approximations.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2004
Reachability Analysis over Term Rewriting Systems.
J. Autom. Reason., 2004

2003
A Java Card CAP converter in PVS.
Electron. Notes Theor. Comput. Sci., 2003

Reachability in Conditional Term Rewriting Systems.
Electron. Notes Theor. Comput. Sci., 2003

2001
Reachability Analysis of Term Rewriting Systems with Timbuk.
Proceedings of the Logic for Programming, 2001

2000
Rewriting for Cryptographic Protocol Verification.
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).
PhD thesis, 1998

Decidable Approximations of Sets of Descendants and Sets of Normal Forms.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

1997
Termination Proofs Using gpo Ordering Constraints.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997


  Loading...