The Community for Technology Leaders
Green Image
<p>Incremental data flow analysis algorithms have been designed to deal efficiently with change in evolving software systems. These algorithms document the current state of a software system by incorporating change effects into previously derived information describing the definition and use of data in the system. Unfortunately, the performance of these algorithms cannot, in general, be characterized by analytic predictions of their expected behavior. It is possible, however, to observe their performance empirically and predict their average behavior. The authors report on experiments on the empirical profiling of a general-purpose, incremental data flow analysis algorithm. The algorithm, dominator based and coded in C, was applied to statistically significant numbers of feasible, random software systems of moderate size. The experimental results, with quantifiable confidence limits, substantiate the claim that incremental analyses are viable and grow more valuable as a software system grows in size.</p>
incremental data flow analysis algorithm; evolving software systems; empirical profiling; parallel programming; program testing.

B. Ryder, H. Pande and W. Landi, "Profiling an Incremental Data Flow Analysis Algorithm," in IEEE Transactions on Software Engineering, vol. 16, no. , pp. 129-140, 1990.
87 ms
(Ver 3.3 (11022016))