Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects

Choi, Jong-Deok; Burke, Michael G.; Carini, Paul

doi:10.1145/158511.158639

Cited by 278 publications

(191 citation statements)

References 24 publications

Supporting

Mentioning

191

Contrasting

Order By: Relevance

“…Interprocedural side-effect analysis has a long history, with much of the early work focused on compiler optimisation for languages like C and FORTRAN [7,17]. The use of pointer analysis as a building block quickly became established, and remains critical for many modern side-effect and purity systems (e.g [26,30,22]).…”

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

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

show abstract

“…Previous side effect analyses [5,19,15,18,22,21] have largely originated in the compiler community, and so their focus has been quite different than ours. This different focus led to different tradeoffs in their design and implementation, most notably acceptance of imprecision in return for soundness of immutable classifications.…”

Section: Related Workmentioning

confidence: 99%

Combined static and dynamic mutability analysis

Artzi

Kiežun

Glasser

et al. 2007

Proceedings of the Twenty-Second IEEE/ACM International Conference on Automated Software Engineering

View full text Add to dashboard Cite

show abstract

“…We do not address work in pointer aliasing analysis (see e.g., [3,14]) or semi-automated program verification (see e.g., [10,1]). …”

Section: Related Workmentioning

confidence: 99%

Increasing the Accuracy of Shape and Safety Analysis of Pointer-Based Codes

Diniz

2004

Languages and Compilers for Parallel Computing

View full text Add to dashboard Cite

Abstract. Analyses and transformations of programs that manipulate pointer-based data structures rely on understanding the topological relationships between the nodes ı.e., the overall shape of the data structures. Current static shape analyses either assume correctness of the code or trade-off accuracy for analysis performance, leading in most cases to shape information that is of little use for practical purposes. This paper introduces four novel analysis techniques, namely structural fields, scan loops, assumed/verified shape properties and context tracing. Analysis of structural fields allows compilers to uncover node configurations that play key roles in the data structure. Analysis of scan loops allows compilers to establish accurate relationship between variables that traverse the data structure. Assumed/verified property analysis derives sufficient shape properties that guarantee termination of loops. These properties must be verified during shape analysis for consistency. Context tracing allows the compiler to isolate data structure nodes by evaluation of conditional statements and hence preserve shape accuracy. We believe that future static shape and safety analysis algorithms will have to include some if not all of these techniques to attain a high level accuracy. In this paper we illustrate the application of the proposed techniques to codes that build (correctly as well as incorrectly) sophisticated data structures that are beyond the reach of current approaches.

show abstract

Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects

Cited by 278 publications

References 24 publications

JPure: A Modular Purity System for Java

JPure: A Modular Purity System for Java

Combined static and dynamic mutability analysis

Increasing the Accuracy of Shape and Safety Analysis of Pointer-Based Codes

Contact Info

Product

Resources

About