Thu 29 Oct 2015 16:18 - 16:42 at Grand Station 1 - 8. Static Analysis Chair(s): Werner Dietl

Computing a precise points-to analysis for very large Java programs remains challenging despite the large body of research on points-to analysis. Any approach must solve an underlying dynamic graph reachability problem, for which the best algorithms have near-cubic worst-case runtime complexity, and, hence, previous work does not scale to programs with millions of lines of code. In this work, we present a novel approach for solving the field-sensitive points-to problem for Java with the means of (1) a transitive-closure data-structure, and (2) a pre-computed set of potentially matching load/store pairs to accelerate the fix-point calculation. Experimentation on Java benchmarks validates the superior performance of our approach over the standard context-free language reachability implementations. Our approach computes a points-to index for the OpenJDK with over 1.5 billion tuples in under a minute.

Thu 29 Oct

Displayed time zone: Eastern Time (US & Canada) change

15:30 - 17:30
8. Static AnalysisOOPSLA at Grand Station 1
Chair(s): Werner Dietl University of Waterloo
15:30
24m
Talk
Static Analysis of Event-Driven Node.js JavaScript Applications
OOPSLA
Magnus Madsen University of Waterloo, Frank Tip Samsung Research America, Ondřej Lhoták University of Waterloo
DOI Media Attached
15:54
24m
Talk
EXPLORER : Query- and Demand-Driven Exploration of Interprocedural Control Flow Properties
OOPSLA
Yu Feng University of Texas at Austin, USA, Xinyu Wang UT Austin, Isil Dillig University of Texas at Austin, USA, Calvin Lin University of Texas at Austin, USA
Pre-print Media Attached
16:18
24m
Talk
Giga-Scale Exhaustive Points-To Analysis for Java in Under a MinuteOOPSLA Artifact
OOPSLA
Jens Dietrich Massey University, New Zealand, Nicholas Hollingum University of Sydney, Australia, Bernhard Scholz Oracle Labs, Australia
DOI Media Attached
16:42
24m
Talk
Galois Transformers and Modular Abstract Interpreters: Reusable Metatheory for Program Analysis
OOPSLA
David Darais University of Maryland, College Park, Matthew Might University of Utah, USA, David Van Horn University of Maryland at College Park, USA
DOI Media Attached
17:06
24m
Talk
Learning a Strategy for Adapting a Program Analysis via Bayesian Optimisation
OOPSLA
Hakjoo Oh Korea University, South Korea, Hongseok Yang University of Oxford, UK, Kwangkeun Yi Seoul National University, South Korea
DOI Media Attached