DFAGen - Data Flow Analysis Generator tool

Introduction

Data-flow analysis is a common technique for gathering program information for use in program transformations such as register allocation, dead-code elimination, common subexpression elimination, and scheduling. Current tools for generating data-flow analysis implementations enable that the analysis details be specified orthogonally to the iterative analysis algorithm, but still require implementation details regarding the may and must use and definition sets that occur due to the effects of pointers, side effects, arrays, and user-defined structures. The DFAGen tool enables analysis writers to generate analyses for separable and nonseparable data-flow analyses that are pointer, aggregate, and side-effect cognizant from a specification that assumes only scalars. By hiding the compiler-specific details behind predefined set definitions, the analysis specifications for the DFAGen tool are typically less than ten lines long and similar to those in standard compiler textbooks.

Download Source

Publications

• "Automatic Generation of Pointer-Cognizant Data-Flow Analysis Implementations" In the Eighth International Working Conference on Source Code Analysis and Manipulation (SCAM 2008 ). [pdf] (please note pages 155 and 156 are incorrectly ordered)

Resources

• OpenAnalysis Toolkit
• UseOA-ROSE
• ROSE Compiler

Contributors

• Andrew Stone [webpage]
• Michelle Strout [webpage]
• Shweta Behere

Contact Info