Issue No. 12 - December (1989 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.58766
<p>A technique is presented for incrementally updating solutions to both union and intersection data-flow problems in response to program edits and transformations. For generality, the technique is based on the iterative approach to computing data-flow information. The authors show that for both union and intersection problems, some changes can be incrementally incorporated immediately into the data-flow sets while others are handled by a two-phase approach. The first phase updates the data-flow sets to overestimate the effect of the program change, enabling the second phase to incrementally update the affected data-flow sets to reflect the actual program change. An important problem that is addressed is the computation of the data-flow changes that need to be propagated throughout a program, based on different local code changes. The technique is compared to other approaches to incremental data-flow analysis.</p>
union data flow problems; incremental version; iterative data flow analysis; intersection data-flow problems; program edits; iterative approach; data-flow information; data-flow sets; two-phase approach; data-flow sets; local code changes; iterative methods; parallel programming; set theory; systems analysis
L. Pollock and M. Soffa, "An Incremental Version of Iterative Data Flow Analysis," in IEEE Transactions on Software Engineering, vol. 15, no. , pp. 1537-1549, 1989.