Problem: DCE

Consider the following CFG with branching (cbr) and jumping (jmp) instructions explicitly shown

Find out all the control dependencies among the basic blocks

Apply dead code elimination and show the new CFG (note: no need to optimize jmp instructions)

Problem: Interprocedural Analysis

Consider the following two CFGs of two functions and the available expressions analysis

Use the worst case solution to compute AvailIn(D_p)

Use the flow-insensitive and flow-sensitive summary of q to compute AvailIn(D_p), respectively

Use the context-insensitive and context-sensitive analysis to compute AvailIn(E_q), respectively