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

This paper describes a general framework and its implementation in a tool called EXPLORER for statically answering a class of interprocedural control flow queries about Java programs. EXPLORER allows users to formulate queries about feasible callstack configurations using regular expressions, and it employs a precise, demand-driven algorithm for answering such queries. Specifically, EXPLORER constructs an automaton A that is iteratively refined until either the language accepted by A is empty (meaning that the query has been refuted) or until no further refinement is possible based on a precise, context-sensitive abstraction of the program. We evaluate EXPLORER by applying it to three different program analysis tasks, namely, (1) analysis of the observer design pattern in Java, (2) identification of a class of performance bugs, and (3) analysis of inter-component communication in Android applications. Our evaluation shows that EXPLORER is both efficient and precise.

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