Optimize context-sensitive Andersen-style points-to analysis by method summarization and cycle-elimination

Authors:
Li Qian;Zhao Jianhua;Li Xuandong
Affiliations:
The State Key Laboratory, Novel Software Technology of China and Department of Computer Science and Technology, Nanjing University, Nanjing, P.R. China;The State Key Laboratory, Novel Software Technology of China and Department of Computer Science and Technology, Nanjing University, Nanjing, P.R. China;The State Key Laboratory, Novel Software Technology of China and Department of Computer Science and Technology, Nanjing University, Nanjing, P.R. China
Venue:
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Year:
2010

Citing 9
Cited 0

Undecidability of static analysis

ACM Letters on Programming Languages and Systems (LOPLAS)
The undecidability of aliasing

ACM Transactions on Programming Languages and Systems (TOPLAS)
Points-to analysis in almost linear time

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Partial online cycle elimination in inclusion constraint graphs

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Ultra-fast aliasing analysis using CLA: a million lines of C code in a second

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Efficient field-sensitive pointer analysis for C

Proceedings of the 5th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Demand-driven points-to analysis for Java

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Dimensions of precision in reference analysis of object-oriented programming languages

CC'03 Proceedings of the 12th international conference on Compiler construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient context-sensitive, field-based Andersen-style points-to analysis algorithm for Java programs. This algorithm first summarizes methods of the program under analysis using directed graphs. Then it performs local circle elimination on these summary graphs to reduce their sizes. The main analysis algorithm uses these graphs to construct the main points-to graph. Topological sort and cycle-elimination is performed on the nodes of both main points-to graphs and summary graphs to speed up the transitive closure computation on the main points-to graph. A suite of Java program benchmarks are used to demonstrate the efficiency of our algorithm.