+++ title = "Dominance relations" author = "Yann Herklotz" tags = [] categories = [] backlinks = ["1a2"] forwardlinks = ["1a4", "1a3a"] zettelid = "1a3" +++ Dominance analysis is important to figure out the control flow in a program an analyse it, so that it can be optimised. For example, it can be used to generate phi functions correctly for a minimal SSA form \[1\] or it can also be used to generate the data dependency graph to then perform modulo scheduling on \[2\]. Dominance relations are present in a control-flow graph (CFG) ([\#1a4]). A node $i$ dominates another node $j$ if every path from the entry point of the CFG to $j$ contains $i$. In addition to that, the relation is strict if $i \ne j$.