Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.