Back Datenflussanalyse German تجزیه و تحلیل جریان داده Persian データフロー解析 Japanese 데이터 흐름 분석 Korean Dataflytanalyse NB Analýza toku Slovak Анализа протока података Serbian 数据流分析 Chinese
 | This section needs additional citations for verification. (February 2018) |
| Part of a series on |
| Software development |
|---|
Data-flow analysis is a technique for gathering information about the possible set of values calculated at various points in a computer program. A program's control-flow graph (CFG) is used to determine those parts of a program to which a particular value assigned to a variable might propagate. The information gathered is often used by compilers when optimizing a program. A canonical example of a data-flow analysis is reaching definitions.
A simple way to perform data-flow analysis of programs is to set up data-flow equations for each node of the control-flow graph and solve them by repeatedly calculating the output from the input locally at each node until the whole system stabilizes, i.e., it reaches a fixpoint. This general approach, also known as Kildall's method, was developed by Gary Kildall while teaching at the Naval Postgraduate School.[1][2][3][4]
- ^ Cite error: The named reference
Kildall_1972_Optimizationwas invoked but never defined (see the help page). - ^ Cite error: The named reference
Kildall_1973_Optimizationwas invoked but never defined (see the help page). - ^ Cite error: The named reference
Cortesi_1999was invoked but never defined (see the help page). - ^ Cite error: The named reference
Laws_2014_IEEEwas invoked but never defined (see the help page).