원문정보
초록
영어
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.
목차
1. Introduction
2. Concurrent AOP
2.1. Basic Concepts of Concurrent AOP
2.2. AspectJ – A popular AOP language
2.3. Features of AspectJ
2.4. Concurrency Model of AspectJ
3. Review of Related Work
4. Some Basic Concepts and Definitions
4.1. Definitions
5. Intermediate Program Representation
5.1. Concurrent Aspect-oriented System Dependence Graph (CASDG)
5.2. Construction of CASDG
6. Concurrent Aspect-oriented Dynamic Slicing (CADS) Algorithm
6.1. Algorithm: Concurrent Aspect-oriented Dynamic Slicing (CADS) Algorithm
6.2. Working of CADS Algorithm
6.3. Complexity Analysis
6.4. Correctness of CADS Algorithm
7. Implementation
7.1. Overview of the Design of DSCAP
8. Conclusion
References