Interprocedural slicing using dependence graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The use of program dependence graphs in software engineering
ICSE '92 Proceedings of the 14th international conference on Software engineering
Debugging with dynamic slicing and backtracking
Software—Practice & Experience
Experimental results from dynamic slicing of C programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An overview and comparative classification of program slicing techniques
Journal of Systems and Software
Precise interprocedural chopping
SIGSOFT '95 Proceedings of the 3rd ACM SIGSOFT symposium on Foundations of software engineering
Slicing object-oriented software
Proceedings of the 18th international conference on Software engineering
A fast algorithm for finding dominators in a flowgraph
ACM Transactions on Programming Languages and Systems (TOPLAS)
Problems in application software maintenance
Communications of the ACM
ICSE '81 Proceedings of the 5th international conference on Software engineering
Implications of Evolution Metrics on Software Maintenance
ICSM '98 Proceedings of the International Conference on Software Maintenance
Using a Concept Lattice of Decomposition Slices for Program Understanding and Impact Analysis
IEEE Transactions on Software Engineering
Design and Implementation of a Fine-Grained Software Inspection Tool
IEEE Transactions on Software Engineering
CONSIT: a fully automated conditioned program slicer
Software—Practice & Experience
Hypertext support for the information needs of software maintainers
Journal of Software Maintenance and Evolution: Research and Practice
Program dependence graph based slicing for Java
SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
Hi-index | 0.00 |
Software engineers and maintainers constantly need to understand legacy programs while correcting errors and making safe modifications. For example, applications programmed in Visual Basic often need to be rewritten to meet modern requirements. Program slicing is a technique which supports well these needs. However, there were no earlier slicers for Visual Basic. Therefore, we have studied the feasibility of slicing Visual Basic. This paper represents a program slicer called GRACE for Visual Basic. GRACE is implemented in C++ and GCC. It contains a parser, fully supporting Visual Basic and other components needed to enable slicing. Its slicing capabilities are based on program dependence graphs (PDGs). Use of PDGs is elegant and helps to keep the implementation simple and slicing efficiency sufficient. The current implementation of GRACE supports static backward slicing. The implementation validates the feasibility of the PDG-based slicing approach in this context. GRACE is also compared to other slicing tools.