May/must analysis and the DFAGen data-flow analysis generator

  • Authors:

  • Andrew Stone;Michelle Strout;Shweta Behere

  • Affiliations:

  • Colorado State University, Computer Science Department, 1873 Campus Delivery, Fort Collins, CO 80523-1873, United States;Colorado State University, Computer Science Department, 1873 Campus Delivery, Fort Collins, CO 80523-1873, United States;Avaya Inc., 1033 McCarthy Blvd, Milpitas, CA 95035-7912, United States

  • Venue:
  • Information and Software Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 analysis details to 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. This paper presents the Data-Flow Analysis Generator tool (DFAGen), which 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. The main contribution of this work is the automatic determination of when to use the may or must variant of a predefined set usage in the analysis specification.