A Novel Approach for Computing Dynamic Slices of Aspect-Oriented Programs
This work addresses a domain-specific problem for developers working with aspect-oriented programming, and it appears incremental as it extends an existing method to a new context.
The authors tackled the problem of computing dynamic slices for aspect-oriented programs by proposing a new algorithm based on an extended version of the EMDS algorithm, using an Aspect System Dependence Graph representation, but no concrete results or numbers are provided.
We propose a dynamic slicing algorithm to compute the slices of aspect-oriented programs. We use a dependence based intermediate program representation called Aspect System Dependence Graph (AOSG) to represent aspect-oriented programs. Then, we propose the dynamic slicing algorithm for AOPs, which is an extended version of EMDS algorithm for object-oriented programs. Our algorithm is based on marking and unmarking of the edges of AOSG appropriately during runtime.