A Practical Escape and Effect Analysis for Building Lightweight Method Summaries

Cherem, Sigmund; Rugina, Radu

doi:10.1007/978-3-540-71229-9_12

Cited by 15 publications

(11 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, the ability to create and use clientindependent library summary information presents a number of technical challenges in terms of analysis abstractions and algorithms. There is a body of work on various approaches to address these challenges (e.g., [8,11,23,27,28,39]). A second, very significant problem is the need for infrastructure support to seamlessly apply precomputed summary information.…”

Section: Introductionmentioning

confidence: 99%

Rethinking Soot for summary-based whole-program analysis

Yan

Rountev

2012

Proceedings of the ACM SIGPLAN International Workshop on State of the Art in Java Program Analysis

View full text Add to dashboard Cite

Whole-program static analysis has been extensively studied and widely used in the past few decades. For modern object-oriented programs, scalability has become an important issue for using whole-program analysis in real-world tools. In addition, the everincreasing size of libraries (e.g., the JDK library) and frameworks exacerbates the scalability problems. To achieve the desired level of analysis performance, an effective approach could be to generate and apply analysis summary information for library methods. In this paper, such an approach is referred to as a summary-based whole-program analysis. The challenges for this technique are twofold: (1) carefully designed abstractions and algorithms are needed to create and use client-independent and analysis-specific library summary information; and (2) support for summary generation and application should be effectively incorporated into existing analysis infrastructures.This paper focuses on the second challenge. It uses Soot, a widely-used program analysis framework for Java, as a vehicle to explore some of the important issues in providing analysis infrastructures with capabilities for summary-based analysis. Experimental studies are presented to show that significant savings can potentially be achieved by making a whole-program alias analysis summary-based. To actually achieve these savings, the paper proposes to extend Soot to add support for summary-based analysis. Finally, a brief discussion of the required framework extensions is presented.

show abstract

Section: Introductionmentioning

confidence: 99%

Rethinking Soot for summary-based whole-program analysis

Yan

Rountev

2012

Proceedings of the ACM SIGPLAN International Workshop on State of the Art in Java Program Analysis

View full text Add to dashboard Cite

show abstract

“…Here, pure is taken to mean: is not accessed at all. Cherem and Rugina describes a mechanism for annotating methods with summaries of heap effects in Java programs [6]. In principle, these could be checked modularly, although they did not directly address this.…”

Section: Related Workmentioning

confidence: 99%

JPure: A Modular Purity System for Java

Pearce

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Purity Analysis is the problem of determining whether or not a method may have side-effects. This has applications in automatic parallelisation, extended static checking, and more. We present a novel purity system for Java that employs purity annotations which can be checked modularly. This is done using a flow-sensitive, intraprocedural analysis. The system exploits two properties, called freshness and locality, to increase the range of methods that can be considered pure. JPure also includes an inference engine for annotating legacy code. We evaluate our system against several packages from the Java Standard Library. Our results indicate it is possible to uncover significant amounts of purity efficiently.

show abstract

“…Cherem and Rugina [7] present a flow-insensitive, unification-based context-sensitive analysis to construct method summaries that describe heap effects. The analysis is parameterized for specifying the depth of the heap to analyze (k) and the number of fields to track per object (b).…”

Section: Related Workmentioning

confidence: 99%

Faster Alias Set Analysis Using Summaries

Naeem

Lhoták

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Alias sets are an increasingly used abstraction in situations which require flow-sensitive tracking of objects through different points in time and the ability to perform strong updates on individual objects. The interprocedural and flow-sensitive nature of these analyses often make them difficult to scale. In this paper, we use two types of method summaries (callee and caller) to improve the performance of an interprocedural flow-and context-sensitive alias set analysis. We present callee method summaries and algorithms to compute them. The computed summaries contain sufficient escape and return value information to selectively replace flow-sensitive analysis of methods without affecting analysis precision. When efficiency is a bigger concern, we also use caller method summaries which provide conservative initial assumptions for pointer and aliasing relations at the start of a method. Using caller summaries in conjunction with callee summaries enables the alias set analysis to flow-sensitively analyze only methods containing points of interest thereby reducing running time. We present results from empirically evaluating the use of these summaries for the alias set analysis. Additionally, we also discuss precision results from a realistic client analysis for verifying temporal safety properties. The results show that although caller summaries theoretically reduce precision, empirically they do not. Furthermore, on average, using callee and caller summaries reduces the running time of the alias set analysis by 27% and 96%, respectively.

show abstract

A Practical Escape and Effect Analysis for Building Lightweight Method Summaries

Cited by 15 publications

References 25 publications

Rethinking Soot for summary-based whole-program analysis

Rethinking Soot for summary-based whole-program analysis

JPure: A Modular Purity System for Java

Faster Alias Set Analysis Using Summaries

Contact Info

Product

Resources

About