Parameterized object sensitivity for points-to and side-effect analyses for Java

Milanova, Mariofanna; Rountev, Atanas; Ryder, Barbara G.

doi:10.1145/566173.566174

Cited by 23 publications

(59 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The flow-sensitive version is more precise but slower and unscalable, and the flow-insensitive version provides adequate precision for certain applications. Milanova et al (2002) provide a yet more precise algorithm via an object-sensitive, flow-insensitive points-to analysis that analyzes a method separately for each of the objects on which the method is invoked. Object sensitivity outperforms Andersen's context-insensitive analysis .…”

Section: Discovering Mutabilitymentioning

confidence: 99%

See 1 more Smart Citation

Parameter reference immutability: formal definition, inference tool, and comparison

Artzi¹,

Kiežun²,

Quinonez³

et al. 2008

Autom Softw Eng

View full text Add to dashboard Cite

Knowing which method parameters may be mutated during a method's execution is useful for many software engineering tasks. A parameter reference is immutable if it cannot be used to modify the state of its referent object during the method's execution. We formally define this notion, in a core object-oriented language. Having the formal definition enables determining correctness and accuracy of tools approximating this definition and unbiased comparison of analyses and tools that approximate similar definitions.We present Pidasa, a tool for classifying parameter reference immutability. Pidasa combines several lightweight, scalable analyses in stages, with each stage refining the overall result. The resulting analysis is scalable and combines the strengths of its component analyses. As one of the component analyses, we present a novel dynamic mutability analysis and show how its results can be improved by random input generation. Experimental results on programs of up to 185 kLOC show that, compared to previous approaches, Pidasa increases both run-time performance and overall accuracy of immutability inference.

show abstract

Section: Discovering Mutabilitymentioning

confidence: 99%

“…Side-effect analysis (Choi et al 1993;Milanova et al 2002;Rountev 2004;Sȃlcianu and Rinard 2005;Sȃlcianu 2006) originated in the compiler community and has focused on i-sound analyses. Our work investigates other tradeoffs and other uses for the immutability information.…”

Section: Discovering Mutabilitymentioning

confidence: 99%

Parameter reference immutability: formal definition, inference tool, and comparison

Artzi¹,

Kiežun²,

Quinonez³

et al. 2008

Autom Softw Eng

View full text Add to dashboard Cite

show abstract

“…In this work, class analysis information is needed to construct a graph that approximates all possible object graphs that can happen when arbitrary client code is built on top of Cls; subsequently the approximation of the object graph is used to infer ownership and composition relationships. There is a large body of work on class analysis with different trade-offs between cost and precision (Palsberg and Schwartzbach 1991;Plevyak and Chien 1994;Agesen 1995;Bacon and Sweeney 1996;Grove et al 1997;Ruf 2000;Streckenbach and Snelting 2000;Tip and Palsberg 2000;Sundaresan et al 2000;Liang et al 2001;Rountev et al 2001;Grove and Chambers 2001;Milanova et al 2002Milanova et al , 2005Lam 2002, 2004;Lhotak and Hendren 2003;Berndl et al 2003). In this paper, we propose a general framework for class analysis that encompasses a large number of analyses with varying degrees of cost and precision.…”

Section: Generalized Class Analysismentioning

confidence: 99%

“…In this paper, we propose a general framework for class analysis that encompasses a large number of analyses with varying degrees of cost and precision. The framework can be instantiated to relatively inexpensive and imprecise analyzes such as Rapid Type Analysis (RTA) (Bacon and Sweeney 1996) as well as relatively expensive and precise analyses such as objectsensitive points-to analysis (Milanova et al 2002(Milanova et al , 2005. The object graph construction uses the output of the class analysis.…”

Section: Generalized Class Analysismentioning

confidence: 99%

See 1 more Smart Citation

Composition inference for UML class diagrams

Milanova

2007

Autom Softw Eng

Self Cite

View full text Add to dashboard Cite

Knowing which associations are compositions is important in a tool for the reverse engineering of UML class diagrams. Firstly, recovery of composition relationships bridges the gap between design and code. Secondly, since composition relationships explicitly state a requirement that certain representations cannot be exposed, it is important to determine if this requirement is met by component code. Verifying that compositions are implemented properly may prevent serious program flaws due to representation exposure. We propose an implementation-level composition model based on ownership and a novel approach for identifying compositions in Java software. Our approach is based on static ownership inference; it is parameterized by class analysis and is designed to work on incomplete programs. We present empirical results from two instantiation of our approach. For one of these instantiations, on average 40% of the examined fields account for relationships that are identified as compositions. In addition, we present a precision evaluation which shows that the analysis achieves almost perfect precision-that is, it almost never misses composition relationships. The results indicate that precise identification of interclass relationships can be done with a simple and inexpensive analysis, and thus can be easily incorporated in reverse engineering tools that support iterative model-driven development.

show abstract

A Correspondence between Two Approaches to Interprocedural Analysis in the Presence of Join

Mangal

Naik

Yang

2014

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. Many interprocedural static analyses perform a lossy join for reasons of termination or efficiency. We study the relationship between two predominant approaches to interprocedural analysis, the summarybased (or functional) approach and the call-strings (or k-CFA) approach, in the presence of a lossy join. Despite the use of radically different ways to distinguish procedure contexts by these two approaches, we prove that post-processing their results using a form of garbage collection renders them equivalent. Our result extends the classic result by Sharir and Pnueli that showed the equivalence between these two approaches in the setting of distributive analysis, wherein the join is lossless.We also empirically compare these two approaches by applying them to a pointer analysis that performs a lossy join. Our experiments on ten Java programs of size 400K-900K bytecodes show that the summary-based approach outperforms an optimized implementation of the k-CFA approach: the k-CFA implementation does not scale beyond k=2, while the summarybased approach proves up to 46% more pointer analysis client queries than 2-CFA. The summary-based approach thus enables, via our equivalence result, to measure the precision of k-CFA with unbounded k, for the class of interprocedural analyses that perform a lossy join.

show abstract

Parameterized object sensitivity for points-to and side-effect analyses for Java

Cited by 23 publications

References 0 publications

Parameter reference immutability: formal definition, inference tool, and comparison

Parameter reference immutability: formal definition, inference tool, and comparison

Composition inference for UML class diagrams

A Correspondence between Two Approaches to Interprocedural Analysis in the Presence of Join

Contact Info

Product

Resources

About