B2R2.MiddleEnd.BinGraph.Dominance

B2R2.MiddleEnd.BinGraph.Dominance Namespace

Contains implementations of dominance algorithms for directed graphs.

Type/Module	Description
CooperDominance	Provides the Cooper et al.'s algorithm for dominance computation presented in "A Simple, Fast Dominance Algorithm", SPE 2001.
CooperDominanceFrontier<'V, 'E>	Represents the Cooper et al.'s dominance frontier algorithm presented in their paper "A Simple, Fast Dominance Algorithm", SPE 2001.
CytronDominanceFrontier<'V, 'E>	Represents the Cytron et al.'s dominance frontier algorithm presented in their paper "Efficiently Computing Static Single Assignment Form and the Control Dependence Graph", TOPLAS 1991.
DepthBasedSearchDominance	Provides Georgiadis et al.'s algorithm for dynamic dominance computation presented in "An Experimental Study of Dynamic Dominators", ESA 2012.
IterativeDominance	Provides a simplistic iterative dominance algorithm.
LengauerTarjanDominance	Provides the original (balanced) Lengauer-Tarjan dominance algorithm for dominator computation presented in "A fast algorithm for finding dominators in a flow graph", TOPLAS 1979. This sophisticated version balances when constructing the ancestor forest.
SemiNCADominance	Provides the Semi-NCA algorithm for dominator computation presented in "Finding dominators in practice", ESA 2004.
SimpleLengauerTarjanDominance	Provides the simple Lengauer-Tarjan dominance algorithm for dominator computation presented in "A fast algorithm for finding dominators in a flow graph", TOPLAS 1979. This simple version does not balance when constructing the ancestor forest.