Travelled to:1 × Austria
1 × China
1 × Cyprus
1 × Hungary
1 × Ireland
1 × Poland
1 × Spain
1 × Sweden
1 × United Kingdom
11 × USA
2 × Estonia
2 × France
2 × Germany
Collaborated with:L.J.Hendren M.Madsen N.A.Naeem M.Rapoport F.Tip K.Ali P.Parizek J.Rodriguez D.Petrashko M.Odersky J.Lhoták K.A.Chung ∅ Rei Thiessen Jason Z. S. Hu E.Bodden P.Avgustinov O.d.Moor D.Sereni G.Sittampalam J.Tibble M.Marron A.Banerjee Y.Smaragdakis M.Bravenboer G.Lashari M.McCool A.Le D.Brotherston W.Dietl R.Zarifi Ming-Ho Yee A.S.Christensen S.Kuzins V.Ureche I.Kabir Paul He J.Dolby M.Berndl F.Qian N.Umanee C.Allan E.Hajiyev N.Ongkingco M.Verbaere
Talks about:analysi (14) program (7) call (6) use (6) point (5) java (5) aspect (4) graph (4) languag (3) context (3)
♂ Person: Ondrej Lhoták
DBLP: Lhot=aacute=k:Ondrej
Facilitated 1 volumes:
PrCoContributed to:
2015
2015
20142013
201220122012
20112011
20112010
2009200820082007
20072006
20062005
20052005
200520042004200320032017201820162017201920162017
20182020Wrote 40 papers:
- OOPSLA-2015-MadsenTL #javascript #static analysis
- Static analysis of event-driven Node.js JavaScript applications (MM, FT, OL), pp. 505–519.
- SAS-2015-RapoportLT #analysis #correlation #data flow #precise
- Precise Data Flow Analysis in the Presence of Correlated Method Calls (MR, OL, FT), pp. 54–71.
- ECOOP-2014-AliRLDT #graph #scala #source code
- Constructing Call Graphs of Scala Programs (KA, MR, OL, JD, FT), pp. 54–79.
- ECOOP-2013-AliL #named #program analysis
- Averroes: Whole-Program Analysis without the Whole Program (KA, OL), pp. 378–400.
- CC-2012-MarronLB #analysis #paradigm #programming
- Programming Paradigm Driven Heap Analysis (MM, OL, AB), pp. 41–60.
- ECOOP-2012-AliL #graph
- Application-Only Call Graph Construction (KA, OL), pp. 688–712.
- OOPSLA-2012-ParizekL #abstraction #java #source code
- Predicate abstraction of Java programs with collections (PP, OL), pp. 75–94.
- ASE-2011-ParizekL #identification #traversal
- Identifying future field accesses in exhaustive state space traversal (PP, OL), pp. 93–102.
- CC-2011-NaeemL #alias #analysis #performance #set #summary #using
- Faster Alias Set Analysis Using Summaries (NAN, OL), pp. 82–103.
- CC-2011-RodriguezL #analysis #data flow #parallel
- Actor-Based Parallel Dataflow Analysis (JR, OL), pp. 179–197.
- POPL-2011-LhotakC #analysis #performance #points-to
- Points-to analysis with efficient strong updates (OL, KCAC), pp. 3–16.
- POPL-2011-SmaragdakisBL #comprehension
- Pick your contexts well: understanding object-sensitivity (YS, MB, OL), pp. 17–30.
- CC-2010-NaeemLR #algorithm
- Practical Extensions to the IFDS Algorithm (NAN, OL, JR), pp. 124–144.
- ISMM-2009-NaeemL #alias #analysis #performance #set #using
- Efficient alias set analysis using SSA form (NAN, OL), pp. 79–88.
- CC-2008-LashariLM #architecture #control flow
- Control Flow Emulation on Tiled SIMD Architectures (GL, OL, MM), pp. 100–115.
- OOPSLA-2008-NaeemL #analysis #multi
- Typestate-like analysis of multiple interacting objects (NAN, OL), pp. 347–366.
- ECOOP-2007-BoddenHL #monitoring #performance #program analysis #runtime #staged
- A Staged Static Program Analysis to Improve the Performance of Runtime Monitoring (EB, LJH, OL), pp. 525–549.
- PASTE-2007-Lhotak #graph
- Comparing call graphs (OL), pp. 37–42.
- CC-2006-LhotakH #analysis #points-to #question
- Context-Sensitive Points-to Analysis: Is It Worth It? (OL, LJH), pp. 47–64.
- FATES-RV-2006-AvgustinovBHHLMOSSTV #aspect-oriented #monitoring
- Aspects for Trace Monitoring (PA, EB, EH, LJH, OL, OdM, NO, DS, GS, JT, MV), pp. 20–39.
- CC-2005-LeLH #interprocedural #jit #optimisation #using
- Using Inter-Procedural Side-Effect Information in JIT Optimizations (AL, OL, LJH), pp. 287–304.
- GPCE-2005-AllanACHKLLMSST #aspectj #compilation #named
- abc: The AspectBench Compiler for AspectJ (CA, PA, ASC, LJH, SK, JL, OL, OdM, DS, GS, JT), pp. 10–16.
- OOPSLA-2005-AllanACHKLMSST #aspectj
- Adding trace matching with free variables to AspectJ (CA, PA, ASC, LJH, SK, OL, OdM, DS, GS, JT), pp. 345–364.
- PLDI-2005-AvgustinovCHKLLMSST #aspectj #optimisation
- Optimising aspectJ (PA, ASC, LJH, SK, JL, OL, OdM, DS, GS, JT), pp. 117–128.
- CC-2004-LhotakLH #compilation #framework #ide
- Integrating the Soot Compiler Infrastructure into an IDE (JL, OL, LJH), pp. 281–297.
- PLDI-2004-LhotakH #java #named #relational
- Jedd: a BDD-based relational extension of Java (OL, LJH), pp. 158–169.
- CC-2003-LhotakH #analysis #java #points-to #scalability #using
- Scaling Java Points-to Analysis Using SPARK (OL, LJH), pp. 153–169.
- PLDI-2003-BerndlLQHU #analysis #points-to #using
- Points-to analysis using BDDs (MB, OL, FQ, LJH, NU), pp. 103–114.
- CC-2017-BrotherstonDL #java #named
- Granullar: gradual nullable types for Java (DB, WD, OL), pp. 87–97.
- CC-2018-MadsenZL #data transformation #functional #java #representation #virtual machine
- Tail call elimination and data representation for functional languages on the Java virtual machine (MM, RZ, OL), pp. 139–150.
- OOPSLA-2016-PetrashkoULO #graph #morphism #parametricity #polymorphism
- Call graphs for languages with parametric polymorphism (DP, VU, OL, MO), pp. 394–409.
- OOPSLA-2017-MadsenLT #javascript #reasoning
- A model for reasoning about JavaScript promises (MM, OL, FT), p. 24.
- OOPSLA-2017-RapoportKHL #proving
- A simple soundness proof for dependent object types (MR, IK, PH, OL), p. 27.
- OOPSLA-2019-RapoportL #dependent type #formal method
- A path to DOT: formalizing fully path-dependent types (MR, OL), p. 29.
- PLDI-2016-MadsenYL #datalog #declarative #fixpoint
- From Datalog to flix: a declarative language for fixed points on lattices (MM, MHY, OL), pp. 194–208.
- PLDI-2017-PetrashkoLO #compilation #composition #named #performance #program transformation #using
- Miniphases: compilation using modular and efficient tree transformations (DP, OL, MO), pp. 201–216.
- PLDI-2017-ThiessenL #analysis #pointer
- Context transformations for pointer analysis (RT, OL), pp. 263–277.
- PPDP-2018-MadsenL #logic programming #parametricity
- Implicit Parameters for Logic Programming (MM, OL), p. 14.
- POPL-2020-HuL #decidability
- Undecidability of d<: and its decidable fragments (JZSH, OL), p. 30.