Path sensitive MFP solutions in presence of intersecting infeasible control flow path segments

Computing Maximum Fixed Point Solutions Over Feasible Paths in Data Flow Analyses

“…Instead, we perform the first phase that involves identification of infeasible CFPs once for each program, and the second phase that involves computation of FPMFP is performed once for each different data flow analysis. The core ideas of FPMFP have been presented before [19,20]. This paper enhances the core ideas significantly and provides a complete treatment.…”

“…1. We unify our earlier approaches [19,20] by proposing a novel formalization for handling infeasible paths in the MFP computations. This formalization is based on the containsprefix-of relation (explained in Section 3.3) that precisely distills the useful interactions between MIPS from all possible interactions.…”