Thomas Jensen

Thomas Jensen

Auto-generated profile, based on publicly available information

Thomas Jensen

Inria, Université de Rennes

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 January 2024 in Distributed Ledger Technologies: Research and Practice
Verified
Journal Article
Open access
Luca OlivieriLuca Olivieri
Luca Olivieri
LNLuca Negrini
Luca Negrini
VAVincenzo Arceri
Vincenzo Arceri
TJThomas Jensen
Thomas Jensen
FSFausto Spoto
Fausto Spoto
Once deployed in blockchain, smart contracts become immutable: attackers can exploit bugs and vulnerabilities in their code, that cannot be replaced with a bug-free version. For this reason, the verification of smart contracts before they are deployed in blockchain is important. However, the development of verification tools is not easy, especially if one wants to obtain guarantees by using formal methods. This paper describes the development, from scratch, of a static analyzer based on abstract interpretation for the verification of real-world Tezos smart contracts. The analyzer is generic with respect to the property under analysis. This paper shows taint analysis as a concrete instantiation of the analyzer, at different levels of precision, to detect untrusted cross-contract invocations.

2 December 2022
Verified
Book Chapter
Closed access
PDF file
SBSantiago Bautista
Santiago Bautista
TJThomas Jensen
Thomas Jensen
BMBenoît Montagu
Benoît Montagu

5 January 2016
Verified
Book Chapter
Open access
PDF file
JSJosé Fragoso Santos
José Fragoso Santos
TJThomas Jensen
Thomas Jensen
TRTamara Rezk
Tamara Rezk
ASAlan Schmitt
Alan Schmitt
As JavaScript is highly dynamic by nature, static information flow analyses are often too coarse to deal with the dynamic constructs of the language. To cope with this challenge, we present and prove the soundness of a new hybrid typing analysis for securing information flow in a JavaScript-like language. Our analysis combines static and dynamic typing in order to avoid rejecting programs due to imprecise typing information. Program regions that cannot be precisely typed at static time are wrapped inside an internal boundary statement used by the semantics to interleave the execution of statically verified code with the execution of code that must be dynamically checked.

1 February 2012 in Information and Computation
Verified
Journal Article
Closed access
JMJan Midtgaard
Jan Midtgaard
TJThomas P. Jensen
Thomas P. Jensen

29 August 2018
Verified
Book Chapter
Open access
PDF file
FBFrédéric Besson
Frédéric Besson
TJThomas Jensen
Thomas Jensen
JLJulien Lepiller
Julien Lepiller
Software Fault Isolation (SFI) consists in transforming untrusted code so that it runs within a specific address space, (called the sandbox) and verifying at load-time that the binary code does indeed stay inside the sandbox. Security is guaranteed solely by the SFI verifier whose correctness therefore becomes crucial. Existing verifiers enforce a very rigid, almost syntactic policy where every memory access and every control-flow transfer must be preceded by a sandboxing instruction sequence, and where calls outside the sandbox must implement a sophisticated protocol based on a shadow stack. We propose to define SFI as a defensive semantics, with the purpose of deriving semantically sound verifiers that admit flexible and efficient implementations of SFI. We derive an executable analyser, that works on a per-function basis, which ensures that the defensive semantics does not go wrong, and hence that the code is well isolated. Experiments show that our analyser exhibits the desired flexibility: it validates correctly sandboxed code, it catches code breaking the SFI policy, and it can validate programs where redundant instrumentations are optimised away.

21 January 2025
Verified
Book Chapter
Closed access
PDF file
TLThéo Losekoot
Théo Losekoot
TGThomas Genet
Thomas Genet
TJThomas Jensen
Thomas Jensen