Thomas Genet
Publications
Publications
|
|
Regular Language Type Inference with Term Rewriting - extended versionProceedings of the ACM on Programming Languages, 2020, International Conference on Functional Programming (ICFP), 4 (ICFP), pp.1-29. ⟨10.1145/3408994⟩ |
|
|
Reachability Analysis of Innermost Rewriting - extended versionLogical Methods in Computer Science, 2017, ⟨10.2168/LMCS-???⟩ |
|
|
Termination criteria for tree automata completionJournal of Logical and Algebraic Methods in Programming, 2016, 85, Issue 1, part 1, pp.3-33. ⟨10.1016/j.jlamp.2015.05.003⟩ |
|
|
Equational Approximations for Tree Automata CompletionJournal of Symbolic Computation, 2010, 45(5):574-597, May 2010 (5), pp.574-597 |
Le protocole cryptographique de paiement par carte bancaireInterstices, 2008 |
|
|
Finding Regular Herbrand Models for CHCs using Answer Set ProgrammingHCVS 2025 - 12th Workshop on Horn Clauses for Verification and Synthesis, Emanuele De Angelis, Florian Frohn, Jul 2025, Zagreb, Croatia |
|
|
Verification of programs with ADTs using Shallow Horn ClausesStatic Analysis Symposium, Roberto Giacobazzi, Alessandra Gorla, Oct 2024, Pasadena (CA), United States |
|
|
Automata-Based Verification of Relational Properties of Functions over Algebraic Data StructuresFSCD 2023 - 8th International Conference on Formal Structures for Computation and Deduction, Jun 2023, Rome, Italy. pp.1-21, ⟨10.4230/LIPIcs.FSCD.2023.7⟩ |
|
|
Termination of Ethereum’s Smart ContractsSECRYPT 2020 - 17th International Conference on Security and Cryptography, Jul 2020, Lieusaint - Paris / Virtual, France. pp.39-51, ⟨10.5220/0009564100390051⟩ |
|
|
Completeness of Tree Automata CompletionFSCD 2018 - 3rd International Conference on Formal Structures for Computation and Deduction, Jul 2018, Oxford, United Kingdom. pp.1-20, ⟨10.4230/LIPIcs.FSCD.2018.15⟩ |
Automata and Equations based Approximations for Reachability AnalysisWRLA 2018 - 12th International Workshop on Rewriting Logic and its Applications, Apr 2018, Thessalonique, Greece. pp.1 |
|
|
|
Vérifier des fonctions d'ordre supérieur à l'aide d'automates d'arbre17èmes Journées AFADL 2018 - Approches Formelles dans l'Assistance au Développement de Logiciels, May 2018, Grenoble, France. pp.1-3 |
|
|
Extending Timbuk to Verify Functional ProgramsWRLA 2018 - 12th International Worshop on Rewriting Logic and its Applications, Apr 2018, Thessalonique, Greece. pp.153-163, ⟨10.1007/978-3-319-99840-4_9⟩ |
|
|
GPFinder: Tracking the Invisible in Android Malware12th International Conference on Malicious and Unwanted Software, Oct 2017, Fajardo, Puerto Rico. pp.39-46, ⟨10.1109/MALWARE.2017.8323955⟩ |
|
|
Reachability Analysis of Innermost RewritingRewriting Techniques and Applications 2015, 2015, Warshaw, Poland |
|
|
Kharon : Découvrir, comprendre et reconnaître des malware Android par suivi de flux d'informationRendez-vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, May 2015, Troyes, France |
|
|
Vers un outil de vérification formelle légere pour OCamlAFADL, 2015, Bordeaux, France. pp.6 |
|
|
Towards Static Analysis of Functional Programs Using Tree Automata CompletionWorkshop on Rewriting Logic and its Applications, Santiago Escobar, Apr 2014, Grenoble, France. pp.147 - 161, ⟨10.1007/978-3-319-12904-4_8⟩ |
A completion algorithm for lattice tree automataCIAA 2013 - 18th International Conference on Implementation and Application of Automata, Jul 2013, Halifax, NS, Canada. pp.134-145, ⟨10.1007/978-3-642-39274-0_13⟩ |
|
|
|
Equational Abstraction Refinement for Certified Tree Regular Model CheckingICFEM, Nov 2012, Kyoto, Japan. pp.299-315 |
|
|
Proving Reachability Properties on Term Rewriting Systems with StrategiesWorkshop on Strategies in Rewriting, Proving and Programming, 2012, London, United Kingdom |
|
|
Verifying Temporal Regular properties of Abstractions of Term Rewriting SystemsRULE'09, 2009, France. pp.99-108 |
|
|
On the Unobservability of a Trust Relation in Mobile Ad Hoc NetworksInformation Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks, 2009, Belgium. pp.1-11 |
|
|
Towards an Efficient Implementation of Tree Automata Completion12th International Conference on Algebraic Methodology and Software Technology - AMAST'08, Jul 2008, Urbana, Illinois, United States. pp.67-82 |
Rewriting Approximations for Fast Prototyping of Static AnalyzersRewriting Techniques and Applications, 2007, France. pp.48-62 |
|
Using Animation to Improve Formal Specifications of Security ProtocolsThe 2nd National Conference on Security in Network Architectures and Information Systems, 2007, France |
|
Feasible Trace Reconstruction for Rewriting ApproximationsRTA'2006, Aug 2006, Seattle, United States. pp.123-135 |
|
|
|
Decidable Approximations of Sets of Descendants and Sets of Normal forms9th Conference on Rewriting Techniques and Applications, 1998, Tsukuba, Japan, pp.151-165 |
SPAN+AVISPA for Verifying Cryptographic Protocols2017 |
|
|
Checking that Equations on Terms define a Finite Set of Equivalence Classes2025 |
|
|
Verification of programs with ADTs using Shallow Horn Clauses -- extended version2024 |
|
|
Proofs as Cryptography: a new interpretation of the Curry-Howard isomorphism for software certificates2012 |
|
|
Contraintes d'ordre et automates d'arbres pour les preuves de terminaisonInformatique [cs]. Université Henri Poincaré - Nancy 1, 1998. Français. ⟨NNT : 1998NAN10245⟩ |
|
|
Reachability analysis of rewriting for software verificationSoftware Engineering [cs.SE]. Université Rennes 1, 2009 |