During traversal along the marked nodes, the dynamic slice at each node is computed. The statements corresponding to the traversed marked nodes constitute the required dynamic slice for the given slicing criterion. The traversal is started from the desired point specified in the slicing criterion. Finally, the WDG is traversed in forward direction only along the marked nodes. Then, the web application is executed for a given input, specified in slicing criteria, and the nodes in WDG resembling the executed statements are marked. The WAFDS algorithm first constructs the WDG. ![]() We have named our technique Web Application Forward Dynamic Slicing (WAFDS) Algorithm. We have proposed a graph called Web Dependence Graph (WDG) as the intermediate representation to correctly represent web applications. ![]() The slicing technique can efficiently be applied using an intermediate representation of a web application. In our work, we have considered JSP (JavaServer Pages) based web applications. We present a technique to compute dynamic slices for web applications using forward slicing approach. After user entered details, our proposed algorithm computes slice by marking and unmarking the executed edges of WADG appropriately. The WADG is a directed digraph which represents the various types of dependencies like data, control and link that may exists between different statements of web application. We have used a dependence based intermediate program representation, which is named as Web Application Dependency Graph (WADG) for representing a web based application embedded with a scripting language. In this paper we have proposed an algorithm for computing dynamic slices of web based applications. ![]() Moreover, the dynamic slicing obtained for web application is useful in analysis and testing of web sites. A variant of slicing, dynamic slicing based on specific execution when debugged, yeilds more precise executable slices. It extracts slice of codes from a developed program, which have been affected by value of variable for some point of interest. Program slicing is an effective decomposition technique to relevant parts of a program or application during debugging and analysis activities.
0 Comments
Leave a Reply. |