Intra-Procedural Data Flow Analysis
Let L=(L, ?, ????be a meet semi-lattice. Initially associate a lattice value li to each node of the CFG.
A transfer function, te:L -> L, is associated with each edge e.
while there exists an edge e=(s,t)te (ls) < lt do lt = lt ??te (ls)
If the lattice satisfies the descending chain condition, and each transfer function is distributive, then the algorithm converges to the meet-over-all-paths solution.