Conditioned Slicing of Aspect-Oriented Program

摘要

The different variants of slicing techniques of aspect-oriented programs (AOPs) are used in software maintenance, reuse, debugging, testing, program evolution, etc. In this paper, we propose a conditioned slicing algorithm for slicing AOPs, which computes more precise slice in comparison with dynamic slice. First, we have constructed an intermediate representation named conditioned aspect-oriented dependence graph (CAODG) to represent the aspect-oriented programs. The construction of CAODG is based on execution of aspect-oriented program with respect to pre-/post-condition rule, which is defined in aspect code. Then, we have proposed a conditioned slicing algorithm for AOP using the proposed CAODG.