The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas P. Jensen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas P. Jensen
    Types in Program Analysis. [Citation Graph (0, 0)][DBLP]
    The Essence of Computation, 2002, pp:204-222 [Conf]
  2. Marc Éluard, Thomas P. Jensen
    Secure Object Flow Analysis for Java Card. [Citation Graph (0, 0)][DBLP]
    CARDIS, 2002, pp:97-110 [Conf]
  3. Eric Goubault, Thomas P. Jensen
    Homology of Higher Dimensional Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:254-268 [Conf]
  4. Thomas P. Jensen, Daniel Le Métayer, Tommy Thorn
    Coarse Grained Java Security Policies. [Citation Graph (0, 0)][DBLP]
    ECOOP Workshops, 1998, pp:296- [Conf]
  5. Marc Éluard, Thomas P. Jensen, Ewen Denney
    An Operational Semantics of the Java Card Firewall. [Citation Graph (0, 0)][DBLP]
    E-smart, 2001, pp:95-110 [Conf]
  6. David Cachera, Thomas P. Jensen, David Pichardie, Vlad Rusu
    Extracting a Data Flow Analyser in Constructive Logic. [Citation Graph (0, 0)][DBLP]
    ESOP, 2004, pp:385-400 [Conf]
  7. Ewen Denney, Thomas P. Jensen
    Correctness of Java Card Method Lookup via Logical Relations. [Citation Graph (0, 0)][DBLP]
    ESOP, 2000, pp:104-118 [Conf]
  8. Thomas P. Jensen, Torben Æ. Mogensen
    A Backwards Analysis for Compile-time Garbage Collection. [Citation Graph (0, 0)][DBLP]
    ESOP, 1990, pp:227-239 [Conf]
  9. Thomas P. Jensen, Ian Mackie
    Flow Analysis in the Geometry of Interaction. [Citation Graph (0, 0)][DBLP]
    ESOP, 1996, pp:188-203 [Conf]
  10. Frédéric Besson, Guillaume Dufay, Thomas P. Jensen
    A Formal Model of Access Control for Mobile Interactive Devices. [Citation Graph (0, 0)][DBLP]
    ESORICS, 2006, pp:110-126 [Conf]
  11. Thomas P. Jensen, Florimond Ployette, Olivier Ridoux
    Iteration schemes for fixed point calculation. [Citation Graph (0, 0)][DBLP]
    FICS, 2002, pp:69-76 [Conf]
  12. David Cachera, Thomas P. Jensen, David Pichardie, Gerardo Schneider
    Certified Memory Usage Analysis. [Citation Graph (0, 0)][DBLP]
    FM, 2005, pp:91-106 [Conf]
  13. Thomas P. Jensen, Fausto Spoto
    Class Analysis of Object-Oriented Programs through Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2001, pp:261-275 [Conf]
  14. Thomas P. Jensen
    Strictness Analysis in Logical Form. [Citation Graph (0, 0)][DBLP]
    FPCA, 1991, pp:352-366 [Conf]
  15. Thomas P. Jensen
    Abstract Interpretation over Algebraic Data Types. [Citation Graph (0, 0)][DBLP]
    ICCL, 1994, pp:- [Conf]
  16. Thomas P. Jensen, Daniel Le Métayer, Tommy Thorn
    Security and Dynamic Class Loading in Java: A Formalization. [Citation Graph (0, 0)][DBLP]
    ICCL, 1998, pp:4-15 [Conf]
  17. Lindsay Errington, Chris Hankin, Thomas P. Jensen
    Reasoning About Gamma Programs. [Citation Graph (0, 0)][DBLP]
    Theory and Formal Methods, 1993, pp:115-125 [Conf]
  18. Thomas P. Jensen
    Denotational Semantics of Timed Dataflow Programs. [Citation Graph (0, 0)][DBLP]
    Theory and Formal Methods, 1994, pp:381-396 [Conf]
  19. Thomas P. Jensen
    Disjunctive Strictness Analysis [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:174-185 [Conf]
  20. Thomas P. Jensen
    Clock Analysis of Synchronous Dataflow Programs. [Citation Graph (0, 0)][DBLP]
    PEPM, 1995, pp:156-167 [Conf]
  21. Samson Abramsky, Thomas P. Jensen
    A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions. [Citation Graph (0, 0)][DBLP]
    POPL, 1991, pp:49-54 [Conf]
  22. Thomas P. Jensen
    Inference of Polymorphic and Conditional Strictness Properties. [Citation Graph (0, 0)][DBLP]
    POPL, 1998, pp:209-221 [Conf]
  23. Frédéric Besson, Thomas de Grenier de Latour, Thomas P. Jensen
    Secure calling contexts for stack inspection. [Citation Graph (0, 0)][DBLP]
    PPDP, 2002, pp:76-87 [Conf]
  24. Frédéric Besson, Thomas P. Jensen
    Modular Class Analysis with DATALOG. [Citation Graph (0, 0)][DBLP]
    SAS, 2003, pp:19-36 [Conf]
  25. Frédéric Besson, Thomas P. Jensen, Jean-Pierre Talpin
    Polyhedral Analysis for Synchronous Languages. [Citation Graph (0, 0)][DBLP]
    SAS, 1999, pp:51-68 [Conf]
  26. Lindsay Errington, Chris Hankin, Thomas P. Jensen
    A Congruence for Gamma Programs. [Citation Graph (0, 0)][DBLP]
    WSA, 1993, pp:242-253 [Conf]
  27. Thomas P. Jensen
    Axiomatising Uniform Properties of Recursive Data Structures. [Citation Graph (0, 0)][DBLP]
    WSA, 1992, pp:144-151 [Conf]
  28. Thomas P. Jensen, Daniel Le Métayer, Tommy Thorn
    Verification of Control Flow based Security Properties. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Security and Privacy, 1999, pp:89-103 [Conf]
  29. 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]
  30. Pascal Sotin, David Cachera, Thomas P. Jensen
    Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:164, n:3, pp:153-167 [Journal]
  31. Frédéric Besson, Thomas P. Jensen, Daniel Le Métayer
    Model Checking Security Properties of Control Flow Graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2001, v:9, n:3, pp:217-250 [Journal]
  32. Frédéric Besson, Thomas de Grenier de Latour, Thomas P. Jensen
    Interfaces for stack inspection. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2005, v:15, n:2, pp:179-217 [Journal]
  33. Marieke Huisman, Thomas P. Jensen
    Guest editors' introduction: Special issue on Formal Methods for Smart Cards. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2004, v:58, n:1-2, pp:1-2 [Journal]
  34. Thomas P. Jensen
    Conjunctive Type Systems and Abstract Interpretation of Higher-Order Functional Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1995, v:5, n:4, pp:397-421 [Journal]
  35. Anindya Banerjee, Thomas P. Jensen
    Modular Control-Flow Analysis with Rank 2 Intersection Types. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2003, v:13, n:1, pp:87-124 [Journal]
  36. Frédéric Besson, Thomas P. Jensen, David Pichardie
    Proof-carrying code from certified abstract interpretation and fixpoint compression. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:364, n:3, pp:273-291 [Journal]
  37. David Cachera, Thomas P. Jensen, David Pichardie, Vlad Rusu
    Extracting a data flow analyser in constructive logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:342, n:1, pp:56-78 [Journal]
  38. Ewen Denney, Thomas P. Jensen
    Correctness of Java card method lookup via logical relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:283, n:2, pp:305-331 [Journal]
  39. Thomas P. Jensen
    Disjunctive Program Analysis for Algebraic Data Types. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1997, v:19, n:5, pp:751-803 [Journal]
  40. Fausto Spoto, Thomas P. Jensen
    Class analyses as abstract interpretations of trace semantics. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2003, v:25, n:5, pp:578-630 [Journal]
  41. Marc Éluard, Thomas P. Jensen
    Validation du contrôle d'accès dans des cartes à puce multiapplications. [Citation Graph (0, 0)][DBLP]
    Technique et Science Informatiques, 2004, v:23, n:3, pp:323-357 [Journal]
  42. Frédéric Besson, Thomas P. Jensen, Tiphaine Turpin
    Small Witnesses for Abstract Interpretation-Based Proofs. [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:268-283 [Conf]
  43. 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]

  44. Long-Run Cost Analysis by Approximation of Linear Operators over Dioids. [Citation Graph (, )][DBLP]


  45. Automata-Based Confidentiality Monitoring. [Citation Graph (, )][DBLP]


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


  47. Computing Stack Maps with Interfaces. [Citation Graph (, )][DBLP]


  48. Enforcing Secure Object Initialization in Java. [Citation Graph (, )][DBLP]


  49. The MOBIUS Proof Carrying Code Infrastructure. [Citation Graph (, )][DBLP]


  50. Semantic Foundations and Inference of Non-null Annotations. [Citation Graph (, )][DBLP]


  51. Certified Static Analysis by Abstract Interpretation. [Citation Graph (, )][DBLP]


  52. Control-flow analysis of function calls and returns by abstract interpretation. [Citation Graph (, )][DBLP]


  53. A Calculational Approach to Control-Flow Analysis by Abstract Interpretation. [Citation Graph (, )][DBLP]


  54. Enforcing Secure Object Initialization in Java [Citation Graph (, )][DBLP]


  55. Sawja: Static Analysis Workshop for Java [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
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