Publications of Thomas Genet

Load the BibTeX file

Academic Journals

  1. Thomas Genet, Vlad Rusu. Equational Approximations for Tree Automata Completion. Journal of Symbolic Computation, 45(5):574-597, May 2010(5):574-597, 2010.
  2. G. Feuillade, T. Genet, V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. Journal of Automated Reasoning, 33 (3-4):341-383, 2004. download

International Conferences

  1. Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat. Tree Regular Model Checking for Lattice-Based Automata. In CIAA - 18th International Conference on Implementation and Application of Automata, LNCS, Volume 7982, Halifax, Canada, 2013. download
  2. Yohan Boichut, Benoit Boyer, Thomas Genet, Axel Legay. Equational Abstraction Refinement for Certified Tree Regular Model Checking. In ICFEM'12, LNCS, Pages 299-315, Kyoto, Japon, 2012. pdf
  3. T. Genet, Y. Salmon. Proving Reachability Properties on Term Rewriting Systems with Strategies. In 2nd Joint International Workshop on Strategies in Rewriting, Proving and Programming, IWS'12, London, 2012.
  4. Olivier Heen, Gilles Guette, Thomas Genet. On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks. In WISTP 2009 3rd edition, LNCS, Volume 5746, 2009.
  5. B. Boyer, T. Genet. Verifying Temporal Regular properties of Abstractions of Term Rewriting Systems. In Proc. of RULE'09, EPTCS, Volume 21, 2009.
  6. B. Boyer, Thomas Genet, Thomas Jensen. Certifying a Tree Automata Completion Checker. In 4th International Joint Conference, IJCAR 2008, Lectures Notes in Computer Science, Volume 5195, Pages 347-362, 2008.
  7. Olivier Heen, Thomas Genet, S. Geller, N. Prigent. An industrial and academical joint experiment on automated verification of a security protocol. In IFIP MWNS'08 Workshop, 2008.
  8. E. Balland, Y. Boichut, Thomas Genet, P.-E. Moreau. Towards an Efficient Implementation of Tree Automata Completion. In Algebraic Methodology and Software Technology, 12th International Conference, AMAST 2008, Lectures Notes in Computer Science, Volume 5140, Pages 67-82, 2008.
  9. Y. Boichut, T. Genet, T. Jensen, L. Leroux. Rewriting Approximations for Fast Prototyping of Static Analyzers. In RTA, LNCS, Volume 4533, Pages 48-62, 2007.
  10. Y. Boichut, T. Genet, Y. Glouche, O. Heen. Using Animation to Improve Formal Specifications of Security Protocols. In Joint conference SAR-SSI, 2007.
  11. Y. Boichut, T. Genet. Feasible Trace Reconstruction for Rewriting Approximations. In RTA, LNCS, Volume 4098, Pages 123-135, 2006.
  12. Y. Glouche, T. Genet, O. Heen, O. Courtay. A Security Protocol Animator Tool for AVISPA. In ARTIST-2 workshop on security of embedded systems, Pisa (Italy), 2006. download
  13. T. Genet, T. Jensen, V. Kodati, D. Pichardie. A Java Card CAP Converter in PVS. In Proceedings of the 2nd International Workshop on Compiler Optimization Meets Compiler Verification (COCV 2003), 2003. download
  14. T. Genet, Y.-M. Tang-Talpin, V. Viet Triem Tong. Verification of Copy Protection Cryptographic Protocol using Approximations of Term Rewriting Systems. In In Proceedings of Workshop on Issues in the Theory of Security, 2003. download
  15. G. Feuillade, T. Genet. Reachability in conditional term rewriting systems. In FTP'2003, International Workshop on First-Order Theorem Proving, Electronic Notes in Theoretical Computer Science, Volume 86 n. 1, June 2003. download
  16. T. Genet, Valérie Viet Triem Tong. Reachability Analysis of Term Rewriting Systems with Timbuk. In 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Lectures Notes in Artificial Intelligence, Volume 2250, Pages 691-702, 2001. ps
  17. T. Genet, F. Klay. Rewriting for Cryptographic Protocol Verification. In Proceedings 17th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Volume 1831, 2000. ps

National Conferences

  1. Olivier Heen, Gilles Guette, Thomas Genet. Anonymity within trust communities. In SAR-SSI 2008, 3rd conference on security in network architectures and information systems, Nora Cuppens-Boulahia, Philippe Owezarski (eds.), Pages 183-195, 2008.

Research Reports

  1. Thomas Genet. Towards Static Analysis of Functional Programs using Tree Automata Completion. December 2013. download
  2. Thomas Genet, Yann Salmon. Reachability Analysis of Innermost Rewriting. July 2013. download
  3. Thomas Genet, Yann Salmon. Tree Automata Completion for Static Analysis of Functional Programs. January 2013. download
  4. Thomas Genet, Tristan Le Gall, Axel Legay, Valérie Murat. Tree Regular Model Checking for Lattice-Based Automata. Technical Report INRIA, No 0, April 2012. download
  5. Yohan Boichut, Benoît Boyer, Thomas Genet, Axel Legay. Fast Equational Abstraction Refinement for Regular Tree Model Checking. Rapport Technique INRIA, July 2010.
  6. G. Feuillade, T. Genet, V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. Research Report INRIA, No 0, 2003. ps
  7. T. Genet, V. Viet Triem Tong. Proving Negative Conjectures on Equational Theories using Induction and Abstract Interpretation. Research Report INRIA, No 0, 2002. ps
  8. Thomas Genet, Valérie Viet Triem Tong. Reachability Analysis of Term Rewriting Systems with Timbuk (extended version). Technical Report INRIA, No 0, 2001. ps
  9. T. Genet, F. Klay. Rewriting for Cryptographic Protocol Verification (extended version). Technical Report INRIA, No 3921, 2000. ps

Misc

  1. Olivier Heen, Thomas Genet, E. Houssay. Votre protocole est-il vérifié?. pp. 58-68, September 2008.
  2. Thomas Genet. Le protocole cryptographique de paiement par carte bancaire. February 2008. download
  3. Y. Glouche, T. Genet. SPAN - A Security Protocol ANimator for AVISPA - User Manual. 2006. download
  4. T. Genet. Timbuk 2.0 - A Tree Automata Library - Reference Manual and Tutorial. IRISA / Université de Rennes 1, 2003. download

Thesis

  1. Thomas Genet. Reachability Analysis of Rewriting for Software Verification. Habilitation à diriger des recherches Université de Rennes 1, 2009.