Research on the Algorithm for Coarse-Grained Web Program Slicing

Abstract. A novel approach based on constructing coarse-grained system dependence is proposed to compute web program slicing. The method perfects web program semantics and reduces the computation complexity through expanding the signification of coarse-grained and analyzing the dependence among semantic units. Program semantic units are described in detail. The expression of dependence includes data dependence, control dependence and transfer dependence. At length, two algorithms for constructing system dependence graph and computing coarse-grained program slicing are designed