Towards a versatile pointer analysis framework

Authors:
R. Castillo;A. Tineo;F. Corbera;A. Navarro;R. Asenjo;E. L. Zapata
Affiliations:
Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain;Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain
Venue:
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Year:
2006

Citing 15
Cited 0

Analysis of pointers and structures

PLDI '90 Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation
Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
SUIF: an infrastructure for research on parallelizing and optimizing compilers

ACM SIGPLAN Notices
Efficient context-sensitive pointer analysis for C programs

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Solving shape-analysis problems in languages with destructive updating

ACM Transactions on Programming Languages and Systems (TOPLAS)
Which pointer analysis should I use?

Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel Programming with Polaris

Computer
Identifying DEF/USE Information of Statements that Construct and Traverse Dynamic Recursive Data Structures

LCPC '97 Proceedings of the 10th International Workshop on Languages and Compilers for Parallel Computing
Analysis of Dynamic Structures for Efficient Parallel Execution

Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
Soot - a Java bytecode optimization framework

CASCON '99 Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research
A Novel Approach for Detecting Heap-Based Loop-Carried Dependences

ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
Experiences in using cetus for source-to-source transformations

LCPC'04 Proceedings of the 17th international conference on Languages and Compilers for High Performance Computing
An overview of the open research compiler

LCPC'04 Proceedings of the 17th international conference on Languages and Compilers for High Performance Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current pointer analysis techniques fail to find parallelism in heap accesses. However, some of them are still capable of obtaining valuable information about the way dynamic memory is used in pointer-based programs. It would be desirable to have a unified framework with a broadened perspective that can take the best out of available techniques and compensate for their weaknesses. We present an early view of such a framework, featuring a graph-based shape analysis technique. We describe some early experiments that obtain detailed information about how dynamic memory arranges in the heap. Furthermore, we document how def-use information can be used to greatly optimize shape analysis.