Thomas P. Jensen

Orcid: 0000-0002-4064-7170

Affiliations:
  • Inria, Rennes, France


According to our database1, Thomas P. Jensen authored at least 92 papers between 1990 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Axiomatising an information flow logic based on partial equivalence relations.
Int. J. Softw. Tools Technol. Transf., August, 2024

2023
Deriving Abstract Interpreters from Skeletal Semantics.
Proceedings of the Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, 2023

Type-directed Program Transformation for Constant-Time Enforcement.
Proceedings of the International Symposium on Principles and Practice of Declarative Programming, 2023

MichelsonLiSA: A Static Analyzer for Tezos.
Proceedings of the IEEE International Conference on Pervasive Computing and Communications Workshops and other Affiliated Events, 2023

Automata-Based Verification of Relational Properties of Functions over Algebraic Data Structures.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
Lifting Numeric Relational Domains to Algebraic Data Types.
Proceedings of the Static Analysis - 29th International Symposium, 2022

2021
Verification of Program Transformations with Inductive Refinement Types.
ACM Trans. Softw. Eng. Methodol., 2021

Trace-based control-flow analysis.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

2020
Stable relations and abstract interpretation of higher-order programs.
Proc. ACM Program. Lang., 2020

Regular language type inference with term rewriting.
Proc. ACM Program. Lang., 2020

Termination of Ethereum's Smart Contracts.
Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, 2020

Galois Connections for Recursive Types.
Proceedings of the From Lambda Calculus to Cybersecurity Through Program Analysis, 2020

2019
Skeletal semantics and their interpretations.
Proc. ACM Program. Lang., 2019

Inferring frame conditions with static correlation analysis.
Proc. ACM Program. Lang., 2019

Compiling Sandboxes: Formally Verified Software Fault Isolation.
Proceedings of the Programming Languages and Systems, 2019

Information-Flow Preservation in Compiler Optimisations.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018
Modular Software Fault Isolation as Abstract Interpretation.
Proceedings of the Static Analysis - 25th International Symposium, 2018

Verification of high-level transformations with inductive refinement types.
Proceedings of the 17th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, 2018

Verifying Higher-Order Functions with Tree Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

Securing Compilation Against Memory Probing.
Proceedings of the 13th Workshop on Programming Languages and Analysis for Security, 2018

2016
Using JavaScript Monitoring to Prevent Device Fingerprinting.
ERCIM News, 2016

Correlating Structured Inputs and Outputs in Functional Specifications.
Proceedings of the Software Engineering and Formal Methods - 14th International Conference, 2016

Hybrid Monitoring of Attacker Knowledge.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

2015
Hybrid Typing of Secure Information Flow in a JavaScript-Like Language.
Proceedings of the Trustworthy Global Computing - 10th International Symposium, 2015

Dependency Analysis of Functional Specifications with Algebraic Data Structures.
Proceedings of the Formal Methods and Software Engineering, 2015

Certified Abstract Interpretation with Pretty-Big-Step Semantics.
Proceedings of the 2015 Conference on Certified Programs and Proofs, 2015

2014
Inference of polynomial invariants for imperative programs: A farewell to Gröbner bases.
Sci. Comput. Program., 2014

SawjaCard: A Static Analysis Tool for Certifying Java Card Applications.
Proceedings of the Static Analysis - 21st International Symposium, 2014

Browser Randomisation against Fingerprinting: A Quantitative Information Flow Approach.
Proceedings of the Secure IT Systems - 19th Nordic Conference, NordSec 2014, Tromsø, 2014

Pretty-big-step-semantics-based Certified Abstract Interpretation.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014

2013
Pretty-big-step-semantics-based Certified Abstract Interpretation (Preliminary version).
Proceedings of the Semantics, 2013

Result Certification of Static Program Analysers with Automated Theorem Provers.
Proceedings of the Verified Software: Theories, Tools, Experiments, 2013

Hybrid Information Flow Monitoring against Web Tracking.
Proceedings of the 2013 IEEE 26th Computer Security Foundations Symposium, 2013

2012
Control-flow analysis of function calls and returns by abstract interpretation.
Inf. Comput., 2012

Secure the Clones
Log. Methods Comput. Sci., 2012

2011
Secure the Clones - Static Enforcement of Policies for Secure Object Copying.
Proceedings of the Programming Languages and Systems, 2011

2010
Long-run cost analysis by approximation of linear operators over dioids.
Math. Struct. Comput. Sci., 2010

Verifying resource access control on mobile interactive devices.
J. Comput. Secur., 2010

Certified Result Checking for Polyhedral Analysis of Bytecode Programs.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Sawja: Static Analysis Workshop for Java.
Proceedings of the Formal Verification of Object-Oriented Software, 2010

Enforcing Secure Object Initialization in Java.
Proceedings of the Computer Security, 2010

A Provably Correct Stackless Intermediate Representation for Java Bytecode.
Proceedings of the Programming Languages and Systems - 8th Asian Symposium, 2010

2009
Certified Static Analysis by Abstract Interpretation.
Proceedings of the Foundations of Security Analysis and Design V, 2009

2008
A Calculational Approach to Control-Flow Analysis by Abstract Interpretation.
Proceedings of the Static Analysis, 15th International Symposium, 2008

Semantic Foundations and Inference of Non-null Annotations.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2008

Computing Stack Maps with Interfaces.
Proceedings of the ECOOP 2008, 2008

Certifying a Tree Automata Completion Checker.
Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007
Rewriting Approximations for Fast Prototyping of Static Analyzers.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

The MOBIUS Proof Carrying Code Infrastructure.
Proceedings of the Formal Methods for Components and Objects, 6th International Symposium, 2007

Small Witnesses for Abstract Interpretation-Based Proofs.
Proceedings of the Programming Languages and Systems, 2007

2006
Proof-carrying code from certified abstract interpretation and fixpoint compression.
Theor. Comput. Sci., 2006

Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card.
Proceedings of the 4th International Workshop on Quantitative Aspects of Programming Languages, 2006

Certificates of Resource Usage on Mobile Telephones.
Proceedings of the Leveraging Applications of Formal Methods, 2006

A Formal Model of Access Control for Mobile Interactive Devices.
Proceedings of the Computer Security, 2006

Automata-Based Confidentiality Monitoring.
Proceedings of the Advances in Computer Science, 2006

2005
Extracting a data flow analyser in constructive logic.
Theor. Comput. Sci., 2005

Interfaces for stack inspection.
J. Funct. Program., 2005

Certified Memory Usage Analysis.
Proceedings of the FM 2005: Formal Methods, 2005

2004
Validation du contrôle d'accès dans des cartes à puce multiapplications.
Tech. Sci. Informatiques, 2004

Guest editors' introduction: Special issue on Formal Methods for Smart Cards.
J. Log. Algebraic Methods Program., 2004

2003
Class analyses as abstract interpretations of trace semantics.
ACM Trans. Program. Lang. Syst., 2003

Modular Control-Flow Analysis with Rank 2 Intersection Types.
Math. Struct. Comput. Sci., 2003

A Java Card CAP converter in PVS.
Proceedings of the Compiler Optimization Meets Compiler Verification, 2003

Modular Class Analysis with DATALOG.
Proceedings of the Static Analysis, 10th International Symposium, 2003

2002
Correctness of Java card method lookup via logical relations.
Theor. Comput. Sci., 2002

Secure calling contexts for stack inspection.
Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Iteration schemes for fixed point calculation.
Proceedings of the Fixed Points in Computer Science, 2002

Secure Object Flow Analysis for Java Card.
Proceedings of the Fifth Smart Card Research and Advanced Application Conference, 2002

Types in Program Analysis.
Proceedings of the Essence of Computation, Complexity, Analysis, 2002

2001
Model Checking Security Properties of Control Flow Graphs.
J. Comput. Secur., 2001

Class Analysis of Object-Oriented Programs through Abstract Interpretation.
Proceedings of the Foundations of Software Science and Computation Structures, 2001

An Operational Semantics of the Java Card Firewall.
Proceedings of the Smart Card Programming and Security, 2001

1999
Verification of Control Flow based Security Properties.
Proceedings of the 1999 IEEE Symposium on Security and Privacy, 1999

Polyhedral Analysis for Synchronous Languages.
Proceedings of the Static Analysis, 6th International Symposium, 1999

1998
Inference of Polymorphic and Conditional Strictness Properties.
Proceedings of the POPL '98, 1998

Security and Dynamic Class Loading in Java: A Formalization.
Proceedings of the 1998 International Conference on Computer Languages, 1998

Coarse Grained Java Security Policies.
Proceedings of the Object-Oriented Technology, ECOOP'98 Workshop Reader, 1998

1997
Disjunctive Program Analysis for Algebraic Data Types.
ACM Trans. Program. Lang. Syst., 1997

1996
Flow Analysis in the Geometry of Interaction.
Proceedings of the Programming Languages and Systems, 1996

1995
Conjunctive Type Systems and Abstract Interpretation of Higher-Order Functional Programs.
J. Log. Comput., 1995

Clock Analysis of Synchronous Dataflow Programs.
Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1995

1994
Denotational Semantics of Timed Dataflow Programs.
Proceedings of the Proceedings for the Second Imperial College Department of Computing Workshop on Theory and Formal Methods, 1994

Abstract Interpretation over Algebraic Data Types.
Proceedings of the IEEE Computer Society 1994 International Conference on Computer Languages, 1994

1993
A Congruence for Gamma Programs.
Proceedings of the Static Analysis, Third International Workshop, 1993

Reasoning About Gamma Programs.
Proceedings of the Theory and Formal Methods 1993, 1993

1992
Axiomatising Uniform Properties of Recursive Data Structures.
Proceedings of the Actes WSA'92 Workshop on Static Analysis (Bordeaux, 1992

Disjunctive Strictness Analysis
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Homology of Higher Dimensional Automata.
Proceedings of the CONCUR '92, 1992

1991
A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions.
Proceedings of the Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, 1991

Strictness Analysis in Logical Form.
Proceedings of the Functional Programming Languages and Computer Architecture, 1991

1990
Abstract Interpretation vs. Type Inference A Topological Perspective.
Proceedings of the 1990 Glasgow Workshop on Functional Programming, 1990

A Backwards Analysis for Compile-time Garbage Collection.
Proceedings of the ESOP'90, 1990


  Loading...