An incremental version of iterative data flow analysis
- 1 December 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 15 (12) , 1537-1549
- https://doi.org/10.1109/32.58766
Abstract
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.<>Keywords
This publication has 12 references indexed in Scilit:
- Region scheduling: an approach for detecting and redistributing parallelismIEEE Transactions on Software Engineering, 1990
- An efficient approach to data flow analysis in a multiple pass global optimizerPublished by Association for Computing Machinery (ACM) ,1988
- Data flow analysis and its application to software maintenancePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- The impact of interprocedural analysis and optimization on the design of a software development environmentPublished by Association for Computing Machinery (ACM) ,1985
- Incremental data flow analysis in a structured program editorPublished by Association for Computing Machinery (ACM) ,1984
- Incremental Context-Dependent Analysis for Language-Based EditorsACM Transactions on Programming Languages and Systems, 1983
- Incremental data flow analysisPublished by Association for Computing Machinery (ACM) ,1983
- A Fast and Usually Linear Algorithm for Global Flow AnalysisJournal of the ACM, 1976
- Testing flow graph reducibilityJournal of Computer and System Sciences, 1974
- Fast algorithms for the elimination of common subexpressionsActa Informatica, 1973