The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Genet: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Genet, Francis Klay
    Rewriting for Cryptographic Protocol Verification. [Citation Graph (0, 0)][DBLP]
    CADE, 2000, pp:271-290 [Conf]
  2. Thomas Genet, Valérie Viet Triem Tong
    Reachability Analysis of Term Rewriting Systems with Timbuk. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:695-706 [Conf]
  3. Yohan Boichut, Thomas Genet
    Feasible Trace Reconstruction for Rewriting Approximations. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:123-135 [Conf]
  4. Thomas Genet
    Decidable Approximations of Sets of Descendants and Sets of Normal Forms. [Citation Graph (0, 0)][DBLP]
    RTA, 1998, pp:151-165 [Conf]
  5. Thomas Genet, Isabelle Gnaedig
    Termination Proofs Using gpo Ordering Constraints. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:249-260 [Conf]
  6. Guillaume Feuillade, Thomas Genet
    Reachability in Conditional Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:86, n:1, pp:- [Journal]
  7. Thomas Genet, Thomas P. Jensen, Vikash Kodati, David Pichardie
    A Java Card CAP converter in PVS. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:82, n:2, pp:- [Journal]
  8. Guillaume Feuillade, Thomas Genet, Valérie Viet Triem Tong
    Reachability Analysis over Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2004, v:33, n:3-4, pp:341-383 [Journal]
  9. Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luka Le Roux
    Rewriting Approximations for Fast Prototyping of Static Analyzers. [Citation Graph (0, 0)][DBLP]
    RTA, 2007, pp:48-62 [Conf]

  10. Towards an Efficient Implementation of Tree Automata Completion. [Citation Graph (, )][DBLP]


  11. Certifying a Tree Automata Completion Checker. [Citation Graph (, )][DBLP]


  12. On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]


  13. Verifying Temporal Regular Properties of Abstractions of Term Rewriting Systems [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002