An incremental version of iterative data flow analysis

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on software engineering Vol. 15; no. 12; pp. 1537 - 1549
Main Authors: Pollock, L.L., Soffa, M.L.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.12.1989
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Subjects:
Algorithms
Application software
Applied sciences
Computer programming
Computer science
Computer science; control theory; systems
Data analysis
Data flow computing
Exact sciences and technology
Graph representations
Information analysis
Iterative methods
Optimization
Optimization methods
Optimizing compilers
Programming environments
Programs
Software
Software engineering
Software testing
Systems analysis
Transborder data flow
Code generation
Compiler
Compilation
Programming environment
Program transformation
Optimization
Data flow
ISSN:0098-5589, 1939-3520
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/32.58766