Dependency Analysis of Recursive Data Structures Using Automatic Groups

Authors:
D. K. Arvind;T. A. Lewis
Affiliations:
-;-
Venue:
LCPC '98 Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
Year:
1998

Citing 3
Cited 1

Graph types

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Word Processing in Groups

Word Processing in Groups
A Language for Conveying the Aliasing Properties of Dynamic, Pointer-Based Data Structures

Proceedings of the 8th International Symposium on Parallel Processing

Safe Approximation of Data Dependencies in Pointer-Based Structures

LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A framework is described for the static analysis of less regular, pointer-based data structures which have been augmented with explicit structural information. The framework has three distinct parts to it - the specification of structural information, their translation into an internal representation as automatic groups, and the dependency analysis. The application of the method to a case study in fluid flow simulation is described.