Automated Inference of Pointcuts in Aspect-Oriented Refactoring

  • Authors:
  • Prasanth Anbalagan;Tao Xie

  • Affiliations:
  • North Carolina State University, USA;North Carolina State University, USA

  • Venue:
  • ICSE '07 Proceedings of the 29th international conference on Software Engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Software refactoring is the process of reorganizing the internal structure of code while preserving the external behavior. Aspect-Oriented Programming (AOP) provides new modularization of software systems by encapsulating crosscutting concerns. Based on these two techniques, aspect-oriented (AO) refactoring restructures crosscutting elements in code. AO refactoring includes two steps: aspect mining (identification of aspect candidates in code) and as- pect refactoring (semantic-preserving transformation to mi- grate the aspect-candidate code to AO code). Aspect refac- toring clusters similar join points together for the aspect candidates and encapsulates each cluster with an effective pointcut definition. With the increase in size of the code and crosscutting concerns, it is tedious to manually identify aspects and their corresponding join points, cluster the join points, and infer pointcut expressions. Therefore, there is a need to auto- mate the process of AO refactoring. This paper proposes an automated approach that identifies aspect candidates in code and infers pointcut expressions for these aspects. Our approach mines for aspect candidates, identifies the join points for the aspect candidates, clusters the join points, and infers an effective pointcut expression for each clus- ter of join points. The approach also provides an addi- tional testing mechanismto ensure that the inferred pointcut expressions are of correct strength. The empirical results show that our approach helps achieve a significant reduc- tion in the total number of pointcut expressions to be used in the refactored code.