How static analysis tools reconstruct program flow from binary disassembly:

1. Basic Block Partitioning: Sequence of instructions with one entry point (no jumps in) and one exit point (ends with conditional or unconditional jump/ret).
2. Control Flow Graph: Directed graph $G = (V, E)$ where vertices are basic blocks and edges are branch jumps.
3. Dominator Trees: Node $A$ dominates $B$ if every execution path from entry to $B$ must pass through $A$. Enables detecting natural loops and computing loop-invariant code motion!

Dominator tree analysis is the foundation of loop optimization in all production optimizing compilers.

Clear breakdown of compiler graph theory.