default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Genet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c22]Théo Losekoot, Thomas Genet, Thomas P. Jensen:
Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures. FSCD 2023: 7:1-7:22- 2020
- [j5]Timothée Haudebourg, Thomas Genet, Thomas P. Jensen:
Regular language type inference with term rewriting. Proc. ACM Program. Lang. 4(ICFP): 112:1-112:29 (2020) - [c21]Thomas Genet, Thomas P. Jensen, Justine Sauvage
:
Termination of Ethereum's Smart Contracts. ICETE (2) 2020: 39-51
2010 – 2019
- 2018
- [c20]Thomas Genet, Timothée Haudebourg, Thomas P. Jensen:
Verifying Higher-Order Functions with Tree Automata. FoSSaCS 2018: 565-582 - [c19]Thomas Genet:
Completeness of Tree Automata Completion. FSCD 2018: 16:1-16:20 - [c18]Thomas Genet, Tristan Gillard, Timothée Haudebourg, Sébastien Lê Cong:
Extending Timbuk to Verify Functional Programs. WRLA@ETAPS 2018: 153-163 - 2017
- [j4]Thomas Genet, Yann Salmon:
Reachability Analysis of Innermost Rewriting. Log. Methods Comput. Sci. 13(1) (2017) - [c17]Mourad Leslous, Valérie Viet Triem Tong, Jean-François Lalande, Thomas Genet:
GPFinder: Tracking the invisible in Android malware. MALWARE 2017: 39-46 - 2016
- [j3]Thomas Genet:
Termination criteria for tree automata completion. J. Log. Algebraic Methods Program. 85(1): 3-33 (2016) - 2015
- [c16]Thomas Genet, Yann Salmon:
Reachability Analysis of Innermost Rewriting. RTA 2015: 177-193 - 2014
- [c15]Thomas Genet:
Towards Static Analysis of Functional Programs Using Tree Automata Completion. WRLA 2014: 147-161 - [i2]Thomas Genet:
Towards Static Analysis of Functional Programs using Tree Automata Completion. CoRR abs/1410.2901 (2014) - 2013
- [c14]Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat:
A Completion Algorithm for Lattice Tree Automata. CIAA 2013: 134-145 - 2012
- [c13]Yohan Boichut, Benoît Boyer, Thomas Genet, Axel Legay:
Equational Abstraction Refinement for Certified Tree Regular Model Checking. ICFEM 2012: 299-315 - [i1]Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat:
Tree Regular Model Checking for Lattice-Based Automata. CoRR abs/1203.1495 (2012) - 2010
- [j2]Thomas Genet, Vlad Rusu:
Equational approximations for tree automata completion. J. Symb. Comput. 45(5): 574-597 (2010)
2000 – 2009
- 2009
- [b2]Thomas Genet:
Reachability analysis of rewriting for software verification. (Analyse d'atteignabilité en réécriture pour la vérification de programmes). University of Rennes 1, France, 2009 - [c12]Olivier Heen, Gilles Guette, Thomas Genet:
On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks. WISTP 2009: 1-11 - [c11]Benoît Boyer, Thomas Genet:
Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems. RULE 2009: 99-108 - 2008
- [c10]Emilie Balland, Yohan Boichut, Thomas Genet, Pierre-Etienne Moreau:
Towards an Efficient Implementation of Tree Automata Completion. AMAST 2008: 67-82 - [c9]Benoît Boyer, Thomas Genet, Thomas P. Jensen:
Certifying a Tree Automata Completion Checker. IJCAR 2008: 523-538 - 2007
- [c8]Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux:
Rewriting Approximations for Fast Prototyping of Static Analyzers. RTA 2007: 48-62 - 2006
- [c7]Yohan Boichut, Thomas Genet:
Feasible Trace Reconstruction for Rewriting Approximations. RTA 2006: 123-135 - 2004
- [j1]Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong:
Reachability Analysis over Term Rewriting Systems. J. Autom. Reason. 33(3-4): 341-383 (2004) - 2003
- [c6]Guillaume Feuillade, Thomas Genet:
Reachability in Conditional Term Rewriting Systems. FTP 2003: 133-146 - [c5]Thomas Genet, Thomas P. Jensen, Vikash Kodati, David Pichardie:
A Java Card CAP converter in PVS. COCV@ETAPS 2003: 426-442 - 2001
- [c4]Thomas Genet, Valérie Viet Triem Tong:
Reachability Analysis of Term Rewriting Systems with Timbuk. LPAR 2001: 695-706 - 2000
- [c3]Thomas Genet, Francis Klay:
Rewriting for Cryptographic Protocol Verification. CADE 2000: 271-290
1990 – 1999
- 1998
- [b1]Thomas Genet:
Contraintes d'ordre et automates d'arbres pour les preuves de terminaison. (Ordering constraints and tree automata for proving termination). Henri Poincaré University, Nancy, France, 1998 - [c2]Thomas Genet:
Decidable Approximations of Sets of Descendants and Sets of Normal Forms. RTA 1998: 151-165 - 1997
- [c1]Thomas Genet, Isabelle Gnaedig:
Termination Proofs Using gpo Ordering Constraints. TAPSOFT 1997: 249-260
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
