Ravindra, DV (2003) Using Locality of Flow in Dataﬂow Analyses. In: First Asian Symposium on Programming Languages and Systems: APLAS 2003(Lecture Notes in Computer Science), 27-29 November 2003, Beijing , China, Vol.2895, 141-158.
Restricted to Registered users only
Download (212Kb) | Request a copy
Dataﬂow analysis using specifications which are not expressible as uni-directional analyses have found limited use in practice inspite of the fact that they can be shorter and more comprehensible than a corresponding decomposition. This is largely due to the fact that straightforward iterative algorithms on such analyses have non-linear time complexity in the size of the control ﬂowgraph. In this paper, we unify the traditional classes of uni-directional and bidirectional analyses into a more natural class of local ﬂow analyses. The dataﬂow equations for this class can be compactly encoded as matrixvector equations on a path-algebra. We then use methods from pathalgebra to derive efficient algorithms for solving the set of equations. In the best case, we can achieve the eﬃciency of uni-directional analyses. Otherwise, we can decrease the complexity of the analysis as compared with a generic iterative analysis.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||30 Nov 2007|
|Last Modified:||19 Sep 2010 04:36|
Actions (login required)