Sciweavers

Share
CC
2007
Springer

A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees

9 years 3 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ) and ˜O(m). The algorithms use a new compact data structure for representing reducible flow graphs called Annotated Decomposition Trees. This data structure extends a binary tree to represent flowgraph information, dominance relation of flowgraphs, and the topological order of nodes. The construction of the annotated decomposition trees runs in O(n + m). Experiments were conducted with reducible flowgraphs of the SPEC2000 benchmark suite.
Bernhard Scholz, Johann Blieberger
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CC
Authors Bernhard Scholz, Johann Blieberger
Comments (0)
books