| 2008 |
|---|
| 53 | EE | David Cachera,
Thomas P. Jensen,
Arnaud Jobin,
Pascal Sotin:
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids.
AMAST 2008: 122-138 |
| 52 | EE | Frédéric Besson,
Thomas P. Jensen,
Tiphaine Turpin:
Computing Stack Maps with Interfaces.
ECOOP 2008: 642-666 |
| 51 | EE | Laurent Hubert,
Thomas P. Jensen,
David Pichardie:
Semantic Foundations and Inference of Non-null Annotations.
FMOODS 2008: 132-149 |
| 50 | EE | Benoît Boyer,
Thomas Genet,
Thomas P. Jensen:
Certifying a Tree Automata Completion Checker.
IJCAR 2008: 523-538 |
| 49 | EE | Jan Midtgaard,
Thomas P. Jensen:
A Calculational Approach to Control-Flow Analysis by Abstract Interpretation.
SAS 2008: 347-362 |
| 2007 |
|---|
| 48 | EE | Frédéric Besson,
Thomas P. Jensen,
Tiphaine Turpin:
Small Witnesses for Abstract Interpretation-Based Proofs.
ESOP 2007: 268-283 |
| 47 | EE | Gilles Barthe,
Pierre Crégut,
Benjamin Grégoire,
Thomas P. Jensen,
David Pichardie:
The MOBIUS Proof Carrying Code Infrastructure.
FMCO 2007: 1-24 |
| 46 | EE | Yohan Boichut,
Thomas Genet,
Thomas P. Jensen,
Luka Le Roux:
Rewriting Approximations for Fast Prototyping of Static Analyzers.
RTA 2007: 48-62 |
| 2006 |
|---|
| 45 | EE | Gurvan Le Guernic,
Anindya Banerjee,
Thomas P. Jensen,
David A. Schmidt:
Automata-Based Confidentiality Monitoring.
ASIAN 2006: 75-89 |
| 44 | EE | Frédéric Besson,
Guillaume Dufay,
Thomas P. Jensen:
A Formal Model of Access Control for Mobile Interactive Devices.
ESORICS 2006: 110-126 |
| 43 | EE | Pascal Sotin,
David Cachera,
Thomas P. Jensen:
Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card.
Electr. Notes Theor. Comput. Sci. 164(3): 153-167 (2006) |
| 42 | EE | Frédéric Besson,
Thomas P. Jensen,
David Pichardie:
Proof-carrying code from certified abstract interpretation and fixpoint compression.
Theor. Comput. Sci. 364(3): 273-291 (2006) |
| 2005 |
|---|
| 41 | | Michael D. Ernst,
Thomas P. Jensen:
Proceedings of the 2005 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis For Software Tools and Engineering, PASTE'05, Lisbon, Portugal, September 5-6, 2005
ACM 2005 |
| 40 | EE | David Cachera,
Thomas P. Jensen,
David Pichardie,
Gerardo Schneider:
Certified Memory Usage Analysis.
FM 2005: 91-106 |
| 39 | EE | Frédéric Besson,
Thomas de Grenier de Latour,
Thomas P. Jensen:
Interfaces for stack inspection.
J. Funct. Program. 15(2): 179-217 (2005) |
| 38 | EE | David Cachera,
Thomas P. Jensen,
David Pichardie,
Vlad Rusu:
Extracting a data flow analyser in constructive logic.
Theor. Comput. Sci. 342(1): 56-78 (2005) |
| 2004 |
|---|
| 37 | EE | David Cachera,
Thomas P. Jensen,
David Pichardie,
Vlad Rusu:
Extracting a Data Flow Analyser in Constructive Logic.
ESOP 2004: 385-400 |
| 36 | EE | Marieke Huisman,
Thomas P. Jensen:
Guest editors' introduction: Special issue on Formal Methods for Smart Cards.
J. Log. Algebr. Program. 58(1-2): 1-2 (2004) |
| 35 | | Marc Éluard,
Thomas P. Jensen:
Validation du contrôle d'accès dans des cartes à puce multiapplications.
Technique et Science Informatiques 23(3): 323-357 (2004) |
| 2003 |
|---|
| 34 | EE | Frédéric Besson,
Thomas P. Jensen:
Modular Class Analysis with DATALOG.
SAS 2003: 19-36 |
| 33 | EE | Fausto Spoto,
Thomas P. Jensen:
Class analyses as abstract interpretations of trace semantics.
ACM Trans. Program. Lang. Syst. 25(5): 578-630 (2003) |
| 32 | EE | Thomas Genet,
Thomas P. Jensen,
Vikash Kodati,
David Pichardie:
A Java Card CAP converter in PVS.
Electr. Notes Theor. Comput. Sci. 82(2): (2003) |
| 31 | | Anindya Banerjee,
Thomas P. Jensen:
Modular Control-Flow Analysis with Rank 2 Intersection Types.
Mathematical Structures in Computer Science 13(1): 87-124 (2003) |
| 2002 |
|---|
| 30 | EE | Marc Éluard,
Thomas P. Jensen:
Secure Object Flow Analysis for Java Card.
CARDIS 2002: 97-110 |
| 29 | | Thomas P. Jensen,
Florimond Ployette,
Olivier Ridoux:
Iteration schemes for fixed point calculation.
FICS 2002: 69-76 |
| 28 | EE | Frédéric Besson,
Thomas de Grenier de Latour,
Thomas P. Jensen:
Secure calling contexts for stack inspection.
PPDP 2002: 76-87 |
| 27 | EE | Thomas P. Jensen:
Types in Program Analysis.
The Essence of Computation 2002: 204-222 |
| 26 | EE | Ewen Denney,
Thomas P. Jensen:
Correctness of Java card method lookup via logical relations.
Theor. Comput. Sci. 283(2): 305-331 (2002) |
| 2001 |
|---|
| 25 | | Isabelle Attali,
Thomas P. Jensen:
Java on Smart Cards: Programming and Security, First International Workshop, JavaCard 2000, Cannes, France, September 14, 2000, Revised Papers
Springer 2001 |
| 24 | | Isabelle Attali,
Thomas P. Jensen:
Smart Card Programming and Security, International Conference on Research in Smart Cards, E-smart 2001, Cannes, France, September 19-21, 2001, Proceedings
Springer 2001 |
| 23 | EE | Marc Éluard,
Thomas P. Jensen,
Ewen Denney:
An Operational Semantics of the Java Card Firewall.
E-smart 2001: 95-110 |
| 22 | EE | Thomas P. Jensen,
Fausto Spoto:
Class Analysis of Object-Oriented Programs through Abstract Interpretation.
FoSSaCS 2001: 261-275 |
| 21 | | Frédéric Besson,
Thomas P. Jensen,
Daniel Le Métayer:
Model Checking Security Properties of Control Flow Graphs.
Journal of Computer Security 9(3): 217-250 (2001) |
| 2000 |
|---|
| 20 | EE | Ewen Denney,
Thomas P. Jensen:
Correctness of Java Card Method Lookup via Logical Relations.
ESOP 2000: 104-118 |
| 1999 |
|---|
| 19 | EE | Thomas P. Jensen,
Daniel Le Métayer,
Tommy Thorn:
Verification of Control Flow based Security Properties.
IEEE Symposium on Security and Privacy 1999: 89-103 |
| 18 | EE | Frédéric Besson,
Thomas P. Jensen,
Jean-Pierre Talpin:
Polyhedral Analysis for Synchronous Languages.
SAS 1999: 51-68 |
| 1998 |
|---|
| 17 | EE | Thomas P. Jensen,
Daniel Le Métayer,
Tommy Thorn:
Coarse Grained Java Security Policies.
ECOOP Workshops 1998: 296 |
| 16 | EE | Thomas P. Jensen,
Daniel Le Métayer,
Tommy Thorn:
Security and Dynamic Class Loading in Java: A Formalization.
ICCL 1998: 4-15 |
| 15 | EE | Thomas P. Jensen:
Inference of Polymorphic and Conditional Strictness Properties.
POPL 1998: 209-221 |
| 1997 |
|---|
| 14 | EE | Thomas P. Jensen:
Disjunctive Program Analysis for Algebraic Data Types.
ACM Trans. Program. Lang. Syst. 19(5): 751-803 (1997) |
| 1996 |
|---|
| 13 | | Thomas P. Jensen,
Ian Mackie:
Flow Analysis in the Geometry of Interaction.
ESOP 1996: 188-203 |
| 1995 |
|---|
| 12 | | Thomas P. Jensen:
Clock Analysis of Synchronous Dataflow Programs.
PEPM 1995: 156-167 |
| 11 | | Thomas P. Jensen:
Conjunctive Type Systems and Abstract Interpretation of Higher-Order Functional Programs.
J. Log. Comput. 5(4): 397-421 (1995) |
| 1994 |
|---|
| 10 | | Thomas P. Jensen:
Abstract Interpretation over Algebraic Data Types.
ICCL 1994 |
| 9 | | Thomas P. Jensen:
Denotational Semantics of Timed Dataflow Programs.
Theory and Formal Methods 1994: 381-396 |
| 1993 |
|---|
| 8 | | Lindsay Errington,
Chris Hankin,
Thomas P. Jensen:
Reasoning About Gamma Programs.
Theory and Formal Methods 1993: 115-125 |
| 7 | | Lindsay Errington,
Chris Hankin,
Thomas P. Jensen:
A Congruence for Gamma Programs.
WSA 1993: 242-253 |
| 1992 |
|---|
| 6 | | Eric Goubault,
Thomas P. Jensen:
Homology of Higher Dimensional Automata.
CONCUR 1992: 254-268 |
| 5 | | Thomas P. Jensen:
Disjunctive Strictness Analysis
LICS 1992: 174-185 |
| 4 | | Thomas P. Jensen:
Axiomatising Uniform Properties of Recursive Data Structures.
WSA 1992: 144-151 |
| 1991 |
|---|
| 3 | | Thomas P. Jensen:
Strictness Analysis in Logical Form.
FPCA 1991: 352-366 |
| 2 | | Samson Abramsky,
Thomas P. Jensen:
A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions.
POPL 1991: 49-54 |
| 1990 |
|---|
| 1 | | Thomas P. Jensen,
Torben Æ. Mogensen:
A Backwards Analysis for Compile-time Garbage Collection.
ESOP 1990: 227-239 |
