SPAS: scalable path-sensitive pointer analysis on full-sparse SSA

Authors:
Yulei Sui;Sen Ye;Jingling Xue;Pen-Chung Yew
Affiliations:
School of Computer Science and Engineering, UNSW, Australia;School of Computer Science and Engineering, UNSW, Australia;School of Computer Science and Engineering, UNSW, Australia;Department of Computer Science and Engineering, University of Minnesota
Venue:
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Year:
2011

Citing 23
Cited 6

Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
A safe approximate algorithm for interprocedural aliasing

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Context-sensitive interprocedural points-to analysis in the presence of function pointers

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Points-to analysis in almost linear time

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relevant context inference

Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A static analyzer for finding dynamic programming errors

Software—Practice & Experience
Effective Representation of Aliases and Indirect Memory Operations in SSA Form

CC '96 Proceedings of the 6th International Conference on Compiler Construction
Points-to analysis using BDDs

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Tracking pointers with path and context sensitivity for bug detection in C programs

Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Symbolic pointer analysis revisited

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Scalable error detection using boolean satisfiability

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context- and path-sensitive memory leak detection

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
Partial dead code elimination on predicated code regions

Software—Practice & Experience
Refining buffer overflow detection via demand-driven path-sensitive analysis

PASTE '07 Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Towards Path-Sensitive Points-to Analysis

SCAM '07 Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation
Bootstrapping: a technique for scalable flow and context-sensitive pointer alias analysis

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Sound, complete and scalable path-sensitive analysis

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Semi-sparse flow-sensitive pointer analysis

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Level by level: making flow- and context-sensitive pointer analysis scalable for millions of lines of code

Proceedings of the 8th annual IEEE/ACM international symposium on Code generation and optimization
Points-to analysis with efficient strong updates

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pick your contexts well: understanding object-sensitivity

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Flow-sensitive pointer analysis for millions of lines of code

CGO '11 Proceedings of the 9th Annual IEEE/ACM International Symposium on Code Generation and Optimization

On-demand dynamic summary-based points-to analysis

Proceedings of the Tenth International Symposium on Code Generation and Optimization
Static memory leak detection using full-sparse value-flow analysis

Proceedings of the 2012 International Symposium on Software Testing and Analysis
Practical Integrated Analysis of Pointers, Dataflow and Control Flow

ACM Transactions on Programming Languages and Systems (TOPLAS)
An incremental points-to analysis with CFL-Reachability

CC'13 Proceedings of the 22nd international conference on Compiler Construction
Accelerating Dynamic Detection of Uses of Undefined Values with Static Value-Flow Analysis

Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization
A constraint-weaving approach to points-to analysis for AspectJ

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new SPAS (Scalable PAth-Sensitive) framework for resolving points-to sets in C programs that exploits recent advances in pointer analysis. SPAS enables intraprocedural path-sensitivity to be obtained in flow-sensitive and context-sensitive (FSCS) techniques scalably, by using BDDs to manipulate program paths and by performing pointer analysis level-by-level on a full-sparse SSA representation similarly as the state-of-the-art LevPA (the FSCS version of SPAS). Compared with LevPA using all 27 C benchmarks in SPEC CPU2000 and CPU2006, SPAS incurs 18.42% increase in analysis time and 10.97% increase in memory usage on average, while guaranteeing that all points-to sets are obtained with non-decreasing precision.