Pei-Sen Yao

Dense Interprocedural Dominance in Acyclic Graphs: Context Bounds and Compact Queries

Interprocedural dominance asks which program points every matched call-and-return execution must pass on its way to a target. An analysis that writes out immediate dominance pays for the transitive reduction of this order, the minimal dominator graph. Measured instances of that graph look near-linear, with edge-to-node...