Contribution-Based Call Stack Abstraction and Its Application in Pointer Analysis of AspectJ Programs

Different method calls may have different contributions to the precision of the final application when abstracted into the call strings. The existing call string based pointer analysis algorithms do not consider such contribution difference and hence often can not achieve best cost-effectiveness. To solve the problem, this paper firstly proposes a contribution-based call stack abstraction method which abstracts the call stacks to the call strings with the contribution information under consideration. Then, we apply the new call stack abstraction method to the pointer analysis of AspectJ programs and propose a concern-sensitive points-to analysis method. The concern-sensitive points-to analysis is more cost-effective than the ordinary call string based approaches for an application that detects harmful advices. It more concretely and more clearly shows that the contribution-based call stack abstraction can lead to better cost-effectiveness for the given applications.

[1]  Laurie J. Hendren,et al.  Context-sensitive interprocedural points-to analysis in the presence of function pointers , 1994, PLDI '94.

[2]  Uday P. Khedker,et al.  An improved bound for call strings based interprocedural analysis of bit vector frameworks , 2007, TOPL.

[3]  Ondrej Lhoták,et al.  Scaling Java Points-to Analysis Using SPARK , 2003, CC.

[4]  Barbara G. Ryder,et al.  Parameterized object sensitivity for points-to analysis for Java , 2005, TSEM.

[5]  Laurie Hendren,et al.  Soot---a java optimization framework , 1999 .

[6]  Gregor Kiczales,et al.  Aspect-oriented programming , 2001, ESEC/FSE-9.

[7]  Monica S. Lam,et al.  Cloning-based context-sensitive pointer alias analysis using binary decision diagrams , 2004, PLDI '04.

[8]  Martin C. Rinard,et al.  A classification system and analysis for aspect-oriented programs , 2004, SIGSOFT '04/FSE-12.

[9]  Jianwen Zhu,et al.  Symbolic pointer analysis revisited , 2004, PLDI '04.

[10]  Baowen Xu,et al.  Interstatement must aliases for data dependence analysis of heap locations , 2007, PASTE '07.

[11]  Vikram S. Adve,et al.  Making context-sensitive points-to analysis with heap cloning practical for the real world , 2007, PLDI '07.

[12]  Lars Ole Andersen,et al.  Program Analysis and Specialization for the C Programming Language , 2005 .

[13]  Shmuel Katz,et al.  Diagnosis of Harmful Aspects Using Regression Verification , 2004 .

[14]  Barbara G. Ryder.  Dimensions of Precision in Reference Analysis of Object-Oriented Programming Languages , 2003, CC.

[15]  David Walker,et al.  Harmless advice , 2006, POPL '06.

[16]  Qiang Sun,et al.  Aspect-Aware Points-to Analysis , 2008, 2008 Eighth IEEE International Working Conference on Source Code Analysis and Manipulation.

[17]  Atanas Rountev,et al.  Merging equivalent contexts for scalable heap-cloning-based context-sensitive points-to analysis , 2008, ISSTA '08.

[18]  Ondrej Lhoták,et al.  Context-Sensitive Points-to Analysis: Is It Worth It? , 2006, CC.

[19]  Manu Sridharan,et al.  Refinement-based context-sensitive points-to analysis for Java , 2006, PLDI '06.

[20]  Michael Hind,et al.  Pointer analysis: haven't we solved this problem yet? , 2001, PASTE '01.

[21]  Ondrej Lhoták,et al.  abc: an extensible AspectJ compiler , 2005, AOSD '05.