Construction of the System Dependence Graph for Web Application Slicing

Authors:
Filippo Ricca;Paolo Tonella
Affiliations:
-;-
Venue:
SCAM '02 Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation
Year:
2002

Citing 0
Cited 7

Slicing Z specifications

ACM SIGPLAN Notices
A brief survey of program slicing

ACM SIGSOFT Software Engineering Notes
Web Application Slicing in Presence of Dynamic Code Generation

Automated Software Engineering
Formal specification of program slicing

ACM SIGPLAN Notices
Testing web applications

Information and Software Technology
A tool for statistical analysis of navigational modelling for web site personalization and reengineering

WISE'07 Proceedings of the 2007 international conference on Web information systems engineering
Design and implementation of semantic matching based automatic scoring system for C programming language

Edutainment'10 Proceedings of the Entertainment for education, and 5th international conference on E-learning and games

Quantified Score

Hi-index	0.00

Visualization

Abstract

The computation of program slices on Web applications may be useful during debugging, when the amount of code to be inspected can be reduced, and during understanding, since the search for a given functionality can be better focused. The system dependence graph is an appropriate data structure for slice computation, in that it explicitly represents all dependences that have to be taken into account in slice determination.In this paper, the main problems related to the construction of the system dependence graph are considered. With no loss of generality, solutions are presented with reference to the server side programming language PHP and to the client side language Javascript. Most of the difficulties concern event and hyperlink handling, dynamic generation of HTML code, and direct access to HTML elements by client code. An example of Web application is analyzed, supporting the feasibility of the approach.