Research on the Algorithm for Coarse-Grained Web Program Slicing
Lin Du, Yehong Han
Available Online June 2015.
- https://doi.org/10.2991/icecee-15.2015.234How to use a DOI?
- Dependence Graph; Coarse-Grained; Algorithms Implement; Program Slicing
- 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.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Lin Du AU - Yehong Han PY - 2015/06 DA - 2015/06 TI - Research on the Algorithm for Coarse-Grained Web Program Slicing BT - 2015 2nd International Conference on Electrical, Computer Engineering and Electronics PB - Atlantis Press SP - 1260 EP - 1264 SN - 2352-538X UR - https://doi.org/10.2991/icecee-15.2015.234 DO - https://doi.org/10.2991/icecee-15.2015.234 ID - Du2015/06 ER -