Optimizing Sparse Representations for Dataflow Analysis

Erik Ruf

Abstract

Sparse program representations allow interstatement dependences to be represented explicitly, enabling dataflow analyzers to restrict the propagation of information to paths where it could potentially affect the dataflow solution. The paper describes the use of a single sparse program representation, the value dependence graph, in both general and analysis-specific contexts, and demonstrates its utility in reducing the cost of dataflow analysis. We find that several semantics-preserving transformations are beneficial in both contexts.

Details

Publication typeInproceedings
URLhttp://www.acm.org/
PublisherAssociation for Computing Machinery, Inc.
> Publications > Optimizing Sparse Representations for Dataflow Analysis