Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using Program Slicing in Software Maintenance
IEEE Transactions on Software Engineering
Programmers use slices when debugging
Communications of the ACM
ICSM '96 Proceedings of the 1996 International Conference on Software Maintenance
Interprocedural Dynamic Slicing Applied to Interprocedural Data How Testing
ICSM '93 Proceedings of the Conference on Software Maintenance
Construction of the System Dependence Graph for Web Application Slicing
SCAM '02 Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation
Dynamic Model Extraction and Statistical Analysis of Web Applications
WSE '02 Proceedings of the Fourth International Workshop on Web Site Evolution (WSE'02)
ICSM '01 Proceedings of the IEEE International Conference on Software Maintenance (ICSM'01)
Identifying reusable functions using specification driven program slicing: a case study
ICSM '95 Proceedings of the International Conference on Software Maintenance
A Large-Scale Empirical Study of Forward and Backward Static Slice Size and Context Sensitivity
ICSM '03 Proceedings of the International Conference on Software Maintenance
Extracting client-side web user interface controls
ICWE'10 Proceedings of the 10th international conference on Web engineering
Pragmatic reuse in web application development
Proceedings of the 33rd International Conference on Software Engineering
Reusing web application user-interface controls
ICWE'11 Proceedings of the 11th international conference on Web engineering
Extracting client-side web application code
Proceedings of the 21st international conference on World Wide Web
Client-side web application slicing
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
| Hi-index | 0.00 |
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.Construction of the system dependence graph for Web applications is complicated by the presence of dynamically generated code. In fact, a Web application builds the HTML code to be transmitted to the browser at run time. Knowledge of such code is essential for slicing. In this paper an algorithm for the static approximation of the dynamically generated HTML code is proposed. The concatenations of constant strings and variables are propagated according to special purpose flow equations, allowing the estimation of the generated code and the refinement of the system dependence graph.