Slicing Aspect Oriented Programs

Abstract

The Aspect Oriented Programs are quite large and complex, hence difficult to slice an AOP. This requires developing efficient slicing algorithms as well as suitable intermediate representations for AOP. Due to the specific features of AOP language such as joinpoint, pointcut, advice and introduction, existing slicing algorithms for procedural or object-oriented programming languages cannot be applied directly to AOP. Therefore, there is a necessity to devise suitable intermediate representations and efficient algorithms for dynamic slicing of AOP. newline newlineThe aim of this research is to devise a suitable intermediate representation for AOP and to give an efficient algorithm for slicing of Aspect Oriented Program. newline1. Intermediate representations for Aspect Oriented Programs newline2. Algorithm for calculation of slice of AOP using intermediate representation newline3. Comparison of existing slicing techniques with new ideas in terms of time and space complexity newline4. Application of proposed techniques in the societal problem. newline