An Approach for Computing Dynamic Slice of Concurrent Aspect-Oriented Programs
This work addresses a specific problem in software engineering for developers working with concurrent aspect-oriented programs, but it is incremental as it builds on existing methods for concurrent object-oriented programs.
The authors tackled the problem of computing dynamic slices for concurrent aspect-oriented programs by proposing an algorithm based on a Concurrent Aspect-oriented System Dependence Graph (CASDG). The result is an extended version of the NMDS algorithm that marks and unmarks executed nodes during runtime to handle concurrency and aspect-oriented features.
We propose a dynamic slicing algorithm to compute the slice of concurrent aspect-oriented programs. We use a dependence based intermediate program representation called Concurrent Aspect-oriented System Dependence Graph (CASDG) to represent a concurrent aspect-oriented program. The CASDG of an aspect-oriented program consists of a system dependence graph (SDG) for the non-aspect code, a group of dependence graphs for aspect code and some additional dependence edges used to connect the system dependence graph for the non-aspect code to dependence graph for aspect code. The proposed dynamic slicing al-gorithm is an extended version of NMDS algorithm for concurrent object-oriented programs, which is based on marking and unmarking of the executed nodes in CASDG appropriately during run-time.