Complete Def-Use Analysis in Recursive Programs with Dynamic Data Structures

Authors:
R. Castillo;F. Corbera;A. Navarro;R. Asenjo;E. L. Zapata
Affiliations:
Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain E-29071;Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain E-29071;Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain E-29071;Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain E-29071;Dpt. of Computer Architecture, University of Málaga, Complejo Tecnologico, Málaga, Spain E-29071
Venue:
Euro-Par 2008 Workshops - Parallel Processing
Year:
2009

Citing 12
Cited 0

Efficient computation of interprocedural definition-use chains

ACM Transactions on Programming Languages and Systems (TOPLAS)
Software caching and computation migration in Olden

PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
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
Putting pointer analysis to work

POPL '98 Proceedings of the 25th 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)
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
Extended SSA Numbering: Introducing SSA Properties to Language with Multi-level Pointers

CC '98 Proceedings of the 7th International Conference on Compiler Construction
Interprocedural definition-use chains of dynamic recursive data structures

Interprocedural definition-use chains of dynamic recursive data structures
Program Slicing with Dynamic Points-To Sets

IEEE Transactions on Software Engineering
Detecting loop-carried dependences in programs with dynamic data structures

Journal of Parallel and Distributed Computing
Client-driven pointer analysis

SAS'03 Proceedings of the 10th international conference on Static analysis
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

Based on some of our previous works, we show in this paper the possibility of accelerating complex analyses (such as shape analyses, dependence analyses...) thanks to a complete def-use chain analysis. In particular, we put our efforts in accelerating the shape analysis technique developed in our research group. Using the gathered Def-Use(DU) information, we have implemented a code slicing pass that computes the relevant statements required by a client analysis. This work is part of a heap-directed pointer analysis framework, where our final goal is the automatic parallelization of codes based on heap-stored dynamic/recursive data structures.