data flow analysis


Also found in: Acronyms.

data flow analysis

[′dad·ə ¦flō ə‚nal·ə·səs]
(computer science)
The development of models for the movement of information within an organization, indicating the sources and destinations of information and where and how information is transmitted, processed, and stored.

data flow analysis

(programming)
A process to discover the dependencies between different data items manipulated by a program. The order of execution in a data driven language is determined solely by the data dependencies. For example, given the equations

1. X = A + B 2. B = 2 + 2 3. A = 3 + 4

a data-flow analysis would find that 2 and 3 must be evaluated before 1. Since there are no data dependencies between 2 and 3, they may be evaluated in any order, including in parallel.

This technique is implemented in hardware in some pipelined processors with multiple functional units. It allows instructions to be executed as soon as their inputs are available, independent of the original program order.
Mentioned in ?
References in periodicals archive ?
An interval-based approach to exhaustive and incremental interprocedural data flow analysis. ACM Transactions on Programming Languages and Systems, 12, 3, 341-395.
Static data flow analysis: In this step the multiple evaluation sequences in a logic-based architecture specification are found.
Using this technology, in 4-1/2 months we were able to develop and alpha-test a tool for performing complex, global data flow analysis and transformation of Cobol programs having 40,000 lines of code in a single compilation unit.
A generalized theory of bit vector data flow analysis. ACM Trans.
For the purpose of this article, data flow analysis is used in an attempt to optimize variable definitions in a translation program.
Other topics include using stealth mixims to achieve modularity, a Kleene algebra framework for data flow analysis, timed behavior trees, and combining estimates with planning poker.
Elimination Algorithms for Data Flow Analysis Barbara G.
Data flow analysis computes information about the potential behavior of a program in terms of the definitions and uses of data objects.
This analysis can be performed using standard methods of data flow analysis [Hecht 1977; Aho et al.
Our approach consists of first using a data flow analysis to assign each node, n, a set of computations, [S.sub.n], that would be legal alternatives to insert at that node.
In this article, we present a new framework for elimination-based exhaustive and incremental data flow analysis using the DJ graph representation of a program.