Abstract
Incremental data flow analysis seeks to efficiently and precisely update data flow information after source code changes, based on the knowledge of the former solution and the changes, without re-computation from scratch. Inter- procedural modification side effect analysis (i.e., MOD) finds the set of variables modified by execution of a statement. Computing MOD information for a language with general purpose pointers, like C, is very complicated and costly. We study the applicability of the hybrid algorithm to incrementalize PMOD - a subproblem of the MOD problem for C. We also show how to update data flow information when non-structural or structural changes are made to the flow graph.