1.
T. Jensen.
Abstract
Interpretation
in Logical Form. PhD thesis, Imperial College,
University of London, Novembre 1992.
2.
T. Jensen, Analyse
statiques de
programmes : fondements et applications, document d'habilitation à
diriger
des recherches, Université de Rennes 1, décembre 1999.
1.
I. Attali,
T. Jensen
(ed), Proceedings of the International Workshop on Java Card
(Java Card 2000), septembre 2000, Springer Lecture Notes in
Computer
Science vol. 2041.
2.
I. Attali,
T. Jensen (ed), Proceedings
of the International Conference on Research in Smart Card Programming
and
Security (e-Smart 2001), septembre 2001, Springer Lecture Notes in
Computer Science vol. 2140
3.
M. Huisman,
T. Jensen (ed), Journal
of Logic and Algebraic Programming, special issue on Smart Cards,
2004.
4. M. D. Ernst, T. Jensen (ed), Proceedings of ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'05), 2005.
5.
E. Denney and T.
Jensen, (eds). Proc of the 2009 Workshop on Proof Carrying Code and
Software Certification, August, 2009. NASA Publication Series.
1.
T. Jensen.
Conjunctive
type systems and abstract interpretation of higher-order functional
programs. Journal of Logic and Computation, 5(4):397-421
1995.
2.
T. . Jensen.
Disjunctive Program
Analysis for Algebraic Data Types. ACM Transactions on Programming
Languages and Systems, 19(5):752-804, 1997.
3.
F. Besson,
T. Jensen,
D. Le Métayer, T. Thorn. Model checking security properties
of
control flow graphs. Journal of Computer Security, 9:217-250,
2001.
4.
E. Denney,
T. Jensen.
Correctness of Java Card method lookup via logical relations, Theoretical
Computer
Science 283:305-331, 2002.
5.
A. Banerjee,
T. Jensen.
Modular control-flow analysis with rank-2 intersection types, Mathematical
Structures
in Computer Science, 13(1):87-124,2003.
6.
F. Spoto,
T. Jensen. Class
Analyses via Abstract Interpretation of Trace Semantics, ACM
Transactions
on Programming Languages and Systems, 25(5):578-630,2003.
7.
M. Éluard, T. Jensen.
Vérification du
contrôle d'accès dans des cartes à puce multi-applications, Technique
et
Science Informatiques
23(3):323-358,2004.
8.
F. Besson, T. de
Grenier de Latour, T.
Jensen : Interfaces for stack inspection, Journal of Functional
Programming 15(2):179-217, 2005.
9.
D. Cachera, T.
Jensen, D.
Pichardie, V. Rusu : Extracting a data flow analyser in constructive
logic, Theoretical
Computer Science
342(1):56-78, 2005
10. F.
Besson, T. Jensen, D. Pichardie. Proof-Carrying Code from
Certified
Abstract Interpretation and Fixpoint Compression. Theoretical
Computer
Science, 364(3):273-291, 2006.
11. F. Besson, G. Dufay,
T. Jensen, and D. Pichardie. Verifying Resource Access Control on
Mobile Interactive Devices. Journal of Computer Security, 2009.
1.
T. Jensen.
Semantics-based
security analysis, Conférence invitée, 17th International
Conference on Mathematical Foundations of Programming Semantics (MFPS
XVII),
mai 2001.
2.
T. Jensen. Types
in program
analysis, in : The Essence of Computation: Complexity,
Analysis,
Transformation. Essays Dedicated to Neil D. Jones,
T. Mogensen,
D. Schmidt, et I. H. Sudborough (éditeurs), Springer LNCS
vol. 2566 p. 204--222, 2002.
3.
T. Jensen.
Certificates for
resource usage on mobile telephones, Conférence invitée, 2nd IEEE
International Symposium on Leveraging Applications of Formal Methods,
Verification and Validation (Isola 2006), 2006.
4.
T. Jensen. Static Analysis for
Extended Byte Code Verification, Invited talk, 2nd Int. Workshop on
Proof-Carrying Code (PCC’08), 2008.
5.
T. Jensen. From
stack maps to software certificates, Invited talk, 4th Int. Workshop on
Bytecode Semantics, Verification, Analysis and Transformation, ETAPS,
2009.
1.
T. Jensen,
T. Æ. Mogensen,
A Backwards Analysis for Compile Time Garbage
Collection, Proc. of European Symposium on Programming (ESOP'90),
Springer
LNCS 432, p. 227--239, 1990.
2.
S. Abramsky and
T. Jensen. A
relational approach to strictness analysis of higher order polymorphic
functions. Proc. 18th ACM Symposium on Principles of Programming
Languages.
ACM Press, 1991.
3.
T. Jensen.
Strictness analysis in
logical form. J. Hughes, (éditeur), Proc. of 5th ACM
Conference on
Functional Programming Languages and Computer Architecture,
Springer LNCS
vol. 523, 1991.
4.
E. Goubault and
T. Jensen.
Homology of higer dimensional automata. W.R. Cleaveland, (éditeur), Proc.
of
3rd Internationa Conference on Concurrency Theory CONCUR, Springer
LNCS
vol. 630, 1992.
5.
T. Jensen.
Disjunctive strictness
analysis. Proc. of 7th IEEE Symposium on Logic In Computer Science.
Computer
Society Press of the IEEE, 1992.
6.
T. Jensen.
Axiomatising uniform
properties of recursive data structures. M. Billaud et. al.,
(éditeurs), Proc.
of 2nd Workshop on Static Analysis, Bigre no. 81--82, 1992.
7.
L. Errington,
C. Hankin, and
T. Jensen. A congruence for Gamma programs. P. Cousot,
M. Falaschi, G. Filè, and A. Rauzy, (éditeurs), Proc.
3rd
International Workshop on Static Analysis, Springer LNCS vol. 724,
1993.
8.
T. Jensen.
Abstract interpretation
over algebraic data types. H. Bal, (éditeur), Proc. 5th IEEE
International Conference on Computer Languages. IEEE Press, May
1994.
9.
T. Jensen. Clock
analysis of
synchronous dataflow programs. Proc. of ACM Symposium on Partial
Evaluation
and Semantics-Based Program Manipulation, ACM Press, San Diego,
1995.
10.T. Jensen,
and I. Mackie. Flow Analysis in the Geometry of Interaction. Proc.
of
European Symposium on Programming, Linköping. Springer LNCS, 1996.
11.T. Jensen,
Inference of polymorphic and conditional strictness properties, Proc.
of
25th ACM Symposium on Principles of Programming Languages, ACM
Press, 1998
12.T. Jensen,
D. Le Métayer, T. Thorn, Security and dynamic class loading
in Java :
a formalisation, Proc. of 6th IEEE Int. Conference on Conputer
Languages,
IEEE Press, 1998.
13.T. Jensen,
D. Le Métayer, T. Thorn, Verification of control flow based
security
properties, Proc. of the 20th IEEE Symp. on Security and
Privacy,
New York: IEEE Computer Society, p. 89--103, 1999.
14.F. Besson,
T. Jensen, J.-P. Talpin, Polyhedral analysis for synchronous
languages. Proc. of
7th Int. Symp. on Static Analysis. Springer LNCS
vol. 1694,
1999.
15.E. Denney,
T. Jensen, Correctness of Java Card method lookup via logical
relations, Proc. of
European Symposium on Programming, Springer LNCS vol. 1782,
p. 104--118,2000.
16.T. Jensen,
F. Spoto, Class analysis of object-oriented programs through
abstract
interpretation, Proc. of Foundations of Software Science and
Computation Structures (FoSSaCS'01), F. Honsell and
M. Miculan
(éditeurs), Springer LNCS vol. 2030, p. 261--275, 2001.
17.M. Éluard,
T. Jensen, E. Denney, An Operational Semantics of the Java
Card
Firewall, Proc. of Int. Conference on Research in Smart Card
Programming and Security (e-Smart 2001), I. Attali,
T. Jensen
(éditeurs), Springer LNCS, p. 95--110, 2001.
18.I. Siveroni,
T. Jensen, M. Éluard, A Formal Specification of the Java Card
Applet
Firewall, Proc. of Nordic Workshop on Secure IT-Systems,
H. R. Nielson (ed), 2001.
19.T. Jensen,
F. Ployette, O. Ridoux: Iteration Schemes for fixed point
conputation, Proc. of 4th Int workshop on Fixed Points in Computer
Science
(FICS'02), Copenhagen, 2002.
20.F. Besson,
T. de Grenier de Latour, T. Jensen: Secure calling contexts
for stack
inspection. Proc. of 4th Int Conf. on Principles and Practice of
Declarative Programming (PPDP 2002), p. 76--87, ACM Press, 2002.
21.M. Éluard,
T. Jensen: Secure object flow analysis for Java Card, Proc.
of 5th
Smart Card Research and Advanced Application Conference (Cardis'02),
p. 97--110,
USENIX, 2002.
22.L. van
Aertryck, T. Jensen, « UML-CASTING: Test synthesis from UML
models
using constraint resolution », Proc. Approches Formelles
dans
l'Assistance au Développement de Logiciels (AFADL'2003), J.-M.
Jézéquel
(éditeur), INRIA, 15 pp. 2003.
23.T.
Genet, T. Jensen, V. Kodati, D.Pichardie: A Java Card CAP
Converter in
PVS, Proc. of 2nd International Workshop on Compiler
Optimization Meets Compiler Verification (COCV 2003), ENTCS 82(2), 2003.
24.F. Besson, T. Jensen:
Modular Class
Analysis with DATALOG, Proc. of 10th Static Analysis Symposium (SAS
2003),
R.~Cousot (ed), Springer LNCS
vol. 2694, p.19-36, 2003
25.D. Cachera,
T. Jensen, D. Pichardie, V. Rusu. Extracting a Data Flow
Analyser in Constructive Logic, Proc. of 13th European Synposium
on
Programming (ESOP'04), Springer LNCS vol. 2986, p. 385-400,
2004.
26.G. Le
Guernic and Thomas Jensen. Monitoring information flow. In Andrei
Sabelfeld,
editor, Proceedings of the 2005 Workshop on Foundations of
Computer
Security (FCS'05), pages 19-30. DePaul University, June 2005.
27.David
Cachera, Thomas Jensen, David Pichardie, and Gerardo Schneider.
Certified
memory usage analysis. In Proc. of 13th International Symposium on
Formal
Methods (FM'05), pages 91-106. Springer LNCS vol. 3582, 2005.
28.F. Besson,
T. Jensen, and D. Pichardie. A PCC Architecture based on
Certified Abstract
Interpretation. In Proc. of 1st International Workshop on Emerging
Applications of Abstract Interpretation (EAAI'06), ENTCS.
Springer-Verlag,
2006.
29.Frédéric
Besson, Guillaume Dufay, and Thomas Jensen. A formal model of access
control
for mobile interactive devices. In 11th European Symposium On
Research In
Computer Security (ESORICS'06), Springer LNCS vol. 4189, 2006.
30.Pascal
Sotin, David Cachera, and Thomas Jensen. Quantitative Static Analysis
over
semirings: analysing cache behaviour for Java Card. In QAPL06,
Quantitative
Aspects of Programming Languages, volume 1380 of Electronic
Notes in
Theoretical Computer Science. Elsevier, 2006.
31.Gurvan
Le Guernic, Anindya Banerjee, Thomas Jensen, and David Schmidt.
Automaton-based
confidentiality monitoring. In Proceedings of the 11th Annual
Asian
Computing Science Conference. Springer LNCS vol 4435. 2007
32. Frédéric
Besson, Thomas Jensen, Tiphaine Turpin. Small witnesses for abstract
interpretation based proofs. In Proceedings of the 16th European
Symp. on
Programming (ESOP 2007), 2007. Springer LNCS vol 4421.
33. Yohann Boichut,
Thomas Genet, Thomas Jensen, Luka Leroux. Rewriting Approximations for
Fast Prototyping of Static Analyzers. In Proc of Rewritinig Techniques
and Applications (RTA’07), Springer LNCS vol. 4533, pages 48–62, 2007.
34. Gilles Barthe,
Pierre Cregut, Benjamin Gregoire, Thomas Jensen, David Pichardie. The
Mobius Proof Carrying code infrastructure. In Post-proc. of Formal
Methods for Components and Objects (FMCO’07), Springer LNCS, 2008.
35. Laurent Hubert,
Thomas Jensen, and David Pichardie. Semantic foundations and inference
of non-null annotations. In Formal Methods for Open Object-Based
Distributed Systems (FMOODS’08), Springer LNCS vol. 5051, pages
132–149, 2008.
36. Frédéric Besson,
Thomas Jensen, Tiphaine Turpin. Computing Stack Maps with Interfaces,
In Proc. of the 22nd European Conference on Object-Oriented Programming
(ECOOP’08), Springer LNCS vol. 5142, pages 642–666, 2008.
37. Jan Midtgaard
and Thomas Jensen A Calculational Approach to Control-Flow Analysis by
Abstract Interpretation. In 15th International Static Analysis
Symposium, (SAS 2008), Springer LNCS vol. 5079, pages 347–362, 2008.
38. David Cachera
and Thomas Jensen and Arnaud Jobin and Pascal Sotin. Long-Run Cost
Analysis by Approximation of Linear Operators over Dioids. In Proc. of
the 12th International Conference on Algebraic Methodology and Software
Technology (AMAST’08), Springer LNCS vol. 5140, pages 122– 138, 2008.
39. Benoit Boyer,
Thomas Genet, Thomas Jensen. Certifying a Tree Automata Completion
Checker. In Proc. of Internatioanl Joint Conference on Automated
Reasoning (IJCAR’08), Springer LNCS vol. 5195, 2008.
40. Frédéric
Besson and David Cachera and Thomas Jensen and David Pichardie.
Certified Static Analysis by Abstract Interpretation. Foundations of
Security Analysis and Design (FOSAD 2009), Springer LNCS vol. 5705,
2009.
41. Jan Midtgaard
and Thomas Jensen Control Flow Analysis of Function Calls and Returns
by Abstract Interpretation. In Proc. of The 14th ACM SIGPLAN Int.
Conference on Functional Programming (ICFP 2009), ACM Press, 2009.
1.
C. K. Gomard,
T. Jensen,
Support du cours de troisième année en programmation
fonctionnelle au département d'informatique (DIKU) à l'Universite de
Copenhague. DIKU tryk, 1987,1988.
2.
T. Jensen
Abstract interpretation,
type inference and Stone duality. In Proc. of 3rd Annual Glasgow
Workshop
on Functional Programming, Workshops in Computing series.
Springer, 1990.
3.
L. Errington,
C. Hankin, and
T. Jensen. Reasoning about Gamma programs. In G. Burn et.
al.
(ed), Proc. of 1st Imperial College Department of Computing
Workshop on
Theory and Formal Methods. Workshops in Computing Series,
Springer, 1993.
4.
T. Jensen.
Semantic analysis of
synchronous dataflow programs. In Second Imperial College
Department of
Computing Workshop on Theory and Formal Methods, IC Press, 1994.