A new program slicing method that is applicable to Web applications is proposed in this paper. The authors claim that traditional program slicing is not appropriate for Web applications, because they are based on program dependence graphs (PDGs), which are not suitable for Web applications because of their particular characteristics. Based on this idea, the authors propose a new slicing method based on program dependence hypergraphs (PDHGs). Essentially, they introduce an algorithm to perform slicing of Web applications, by applying it to the previously constructed PDHG of the applications.

Unfortunately, the authors don’t present any correctness validation or experimental results for the algorithm. In particular, the paper lacks of an implementation section. At the very least, a short description of the slicer should have been included.

Its underlying idea seems good, but the paper was very difficult to read due to the large number of typographical errors, and the poor English. An example would be useful in clarifying the advantages of the proposal, but, unfortunately, it is not present in the paper. In addition, there is no related work section, so the authors don’t compare their work with other approaches [1].

With the exception of its good underlying idea, I was very disappointed with this paper.