Write a Blog >>
SPLASH 2017
Sun 22 - Fri 27 October 2017 Vancouver, Canada
Fri 27 Oct 2017 10:30 - 10:52 at Regency C - Static Analysis Chair(s): Christian Hammer

Program analyses frequently track objects throughout a program, which requires reasoning about aliases. Most dataflow analysis frameworks, however, delegate the task of handling aliases to the analysis clients, which causes a number of problems. For instance, custom-made extensions for alias analysis are complex and cannot easily be reused. On the other hand, due to the complex interfaces involved, off-the-shelf alias analyses are hard to integrate precisely into clients. Lastly, for precision many clients require strong updates, and alias abstractions supporting strong updates are often relatively inefficient.

In this paper, we present IDEal, an alias-aware extension to the framework for Interprocedural Distributive Environment (IDE) problems. IDEal relieves static-analysis authors completely of the burden of handling aliases by automatically resolving alias queries on-demand, both efficiently and precisely. IDEal supports a highly precise analysis using strong updates by resorting to an on-demand, flow-sensitive, and context-sensitive all-alias analysis. Yet, it achieves previously unseen efficiency by propagating aliases individually, creating highly reusable per-pointer summaries.

We empirically evaluate IDEal by comparing TSf, a state-of-the-art typestate analysis, to TSal, an IDEal-based typestate analysis. Our experiments show that the individual propagation of aliases within IDEal enables TSal to propagate 10.4x fewer dataflow facts and analyze 10.3x fewer methods when compared to TSf. On the DaCapo benchmark suite, TSal is able to efficiently compute precise results.

Fri 27 Oct

Displayed time zone: Tijuana, Baja California change

10:30 - 12:00
Static AnalysisOOPSLA at Regency C
Chair(s): Christian Hammer University of Potsdam
10:30
22m
Talk
IDEal: Efficient and Precise Alias-Aware Dataflow Analysis
OOPSLA
Johannes Späth Fraunhofer IEM, Karim Ali University of Alberta, Eric Bodden Heinz Nixdorf Institut, Paderborn University and Fraunhofer IEM
DOI
10:52
22m
Talk
P/Taint: Unified Points-to and Taint Analysis
OOPSLA
Neville Grech , Yannis Smaragdakis University of Athens
DOI
11:15
22m
Talk
Data-Driven Context-Sensitivity for Points-to Analysis
OOPSLA
Sehun Jeong Korea University, South Korea, Minseok Jeon Korea University, South Korea, Sungdeok (Steve) Cha Korea University, South Korea, Hakjoo Oh Korea University
DOI
11:37
22m
Talk
Automatically Generating Features for Learning Program Analysis Heuristics for C-Like Languages
OOPSLA
Kwonsoo Chae Korea University, Hakjoo Oh Korea University, Kihong Heo University of Pennsylvania, USA, Hongseok Yang University of Oxford
DOI