Travelled to:1 × Australia
1 × Cyprus
1 × Denmark
1 × Portugal
1 × Sweden
2 × France
2 × Spain
2 × United Kingdom
3 × Germany
3 × Italy
7 × USA
Collaborated with:∅ F.Besson D.Cachera J.Midtgaard D.Pichardie T.Turpin F.Kirchner T.Genet F.Spoto E.Denney I.Mackie S.Abramsky T.Æ.Mogensen P.Vittet B.Boyer P.Sotin T.d.G.d.Latour J.Talpin L.Errington C.Hankin A.Jobin Y.Boichut L.L.Roux G.Schneider V.Rusu A.S.Al-Sibahi A.S.Dimovski A.Wasowski Oana Fabiana Andreescu S.Lescuyer B.Montagu M.Bodin P.Gardner A.Schmitt S.Blazy A.Dang P.Wilke
Talks about:analysi (15) interpret (5) static (5) abstract (4) program (4) strict (4) flow (4) card (4) certifi (3) secur (3)
Person: Thomas P. Jensen
DBLP: Jensen:Thomas_P=
Facilitated 1 volumes:
EdContributed to:
20142012
2011
2009
2008
200820082007
2007
2006
200520042003
2002
200120001999
19981996
19951993
19921992
199119911990
201820192019Wrote 30 papers:
- SAS-2014-BessonJV #java #named #static analysis
- SawjaCard: A Static Analysis Tool for Certifying Java Card Applications (FB, TPJ, PV), pp. 51–67.
- SAS-2012-CacheraJJK #imperative #invariant #polynomial #source code
- Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases (DC, TPJ, AJ, FK), pp. 58–74.
- ESOP-2011-JensenKP #policy
- Secure the Clones — Static Enforcement of Policies for Secure Object Copying (TPJ, FK, DP), pp. 317–337.
- ICFP-2009-MidtgaardJ #abstract interpretation #analysis #control flow
- Control-flow analysis of function calls and returns by abstract interpretation (JM, TPJ), pp. 287–298.
- ECOOP-2008-BessonJT #interface #stack
- Computing Stack Maps with Interfaces (FB, TPJ, TT), pp. 642–666.
- IJCAR-2008-BoyerGJ #automaton
- Certifying a Tree Automata Completion Checker (BB, TG, TPJ), pp. 523–538.
- SAS-2008-MidtgaardJ #abstract interpretation #analysis #approach #control flow
- A Calculational Approach to Control-Flow Analysis by Abstract Interpretation (JM, TPJ), pp. 347–362.
- ESOP-2007-BessonJT #abstract interpretation #proving
- Small Witnesses for Abstract Interpretation-Based Proofs (FB, TPJ, TT), pp. 268–283.
- RTA-2007-BoichutGJR #approximate #performance #prototype
- Rewriting Approximations for Fast Prototyping of Static Analyzers (YB, TG, TPJ, LLR), pp. 48–62.
- QAPL-2006-SotinCJ #behaviour #java #static analysis
- Quantitative Static Analysis Over Semirings: Analysing Cache Behaviour for Java Card (PS, DC, TPJ), pp. 153–167.
- FM-2005-CacheraJPS #analysis #memory management
- Certified Memory Usage Analysis (DC, TPJ, DP, GS), pp. 91–106.
- ESOP-2004-CacheraJPR #data flow #logic
- Extracting a Data Flow Analyser in Constructive Logic (DC, TPJ, DP, VR), pp. 385–400.
- SAS-2003-BessonJ #analysis #composition #datalog
- Modular Class Analysis with DATALOG (FB, TPJ), pp. 19–36.
- PPDP-2002-BessonLJ #stack
- Secure calling contexts for stack inspection (FB, TdGdL, TPJ), pp. 76–87.
- FoSSaCS-2001-JensenS #abstract interpretation #analysis #object-oriented #source code
- Class Analysis of Object-Oriented Programs through Abstract Interpretation (TPJ, FS), pp. 261–275.
- ESOP-2000-DenneyJ #correctness #java #logic
- Correctness of Java Card Method Lookup via Logical Relations (ED, TPJ), pp. 104–118.
- SAS-1999-BessonJT #analysis
- Polyhedral Analysis for Synchronous Languages (FB, TPJ, JPT), pp. 51–68.
- POPL-1998-Jensen #polymorphism #strict
- Inference of Polymorphic and Conditional Strictness Properties (TPJ), pp. 209–221.
- ESOP-1996-JensenM #analysis #geometry #interactive
- Flow Analysis in the Geometry of Interaction (TPJ, IM), pp. 188–203.
- PEPM-1995-Jensen #analysis #data flow #source code
- Clock Analysis of Synchronous Dataflow Programs (TPJ), pp. 156–167.
- WSA-1993-ErringtonHJ #congruence #source code
- A Congruence for Gamma Programs (LE, CH, TPJ), pp. 242–253.
- LICS-1992-Jensen #analysis #strict
- Disjunctive Strictness Analysis (TPJ), pp. 174–185.
- WSA-1992-Jensen #axiom #data type #recursion
- Axiomatising Uniform Properties of Recursive Data Structures (TPJ), pp. 144–151.
- FPCA-1991-Jensen #analysis #logic #strict
- Strictness Analysis in Logical Form (TPJ), pp. 352–366.
- POPL-1991-AbramskyJ #analysis #approach #higher-order #polymorphism #relational #strict
- A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions (SA, TPJ), pp. 49–54.
- ESOP-1990-JensenM #analysis #garbage collection
- A Backwards Analysis for Compile-time Garbage Collection (TPJ, TÆM), pp. 227–239.
- GPCE-2018-Al-SibahiJDW #induction #refinement #verification
- Verification of high-level transformations with inductive refinement types (ASAS, TPJ, ASD, AW), pp. 147–160.
- ESOP-2019-BessonBDJW #compilation #fault
- Compiling Sandboxes: Formally Verified Software Fault Isolation (FB, SB, AD, TPJ, PW), pp. 499–524.
- POPL-2019-AndreescuJLM #analysis #correlation
- Inferring frame conditions with static correlation analysis (OFA, TPJ, SL, BM), p. 29.
- POPL-2019-BodinGJS #semantics
- Skeletal semantics and their interpretations (MB, PG, TPJ, AS), p. 31.