(Last modified Thu Apr 17 22:42 2008)
Examples:
The in set of the first statement in a program is empty. The in set of every other statement in a program is the union of the out sets of all statements that can immediately precede it.
d: a=expression"Q then R"Q or R"Q 1 or more times"Dwyer and Clarke's framework consists of five mathematical objects:
| The mathematical objects | An example from dataflow analysis |
|---|---|
| A lattice | The powerset of the definitions |
| A flow graph | The control flow graph of the program (definitions only) |
| A set of transfer functions | How the out set is calculated for each kind of statement |
| A function map binding flow graph entities to transfer functions | Which calculation is used for each statement of the program |
| A confluence map binding flow graph entities to "meet" (GLB) or "join" (LUB) | "Join" (union of the inputs). |