%0 Conference Paper %1 khatchadourian2009pointcut %A Khatchadourian, Raffi %A Greenwood, Phil %A Rashid, Awais %A Xu, Guoqing %B Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering %C Washington, DC, USA %D 2009 %I IEEE Computer Society %K aop induction pattern pointcut rejuvenation %P 575--579 %R 10.1109/ASE.2009.37 %T Pointcut Rejuvenation: Recovering Pointcut Expressions in Evolving Aspect-Oriented Software %U http://dx.doi.org/10.1109/ASE.2009.37 %X Pointcut fragility is a well-documented problem in Aspect-Oriented Programming; changes to the base-code can lead to join points incorrectly falling in or out of the scope of pointcuts. We present an automated approach that limits fragility problems by providing mechanical assistance in pointcut maintenance. The approach is based on harnessing arbitrarily deep structural commonalities between program elements corresponding to join points selected by a pointcut. The extracted patterns are then applied to later versions to offer suggestions of new join points that may require inclusion. We demonstrate the usefulness of our technique by rejuvenating pointcuts in multiple versions of several open-source AspectJ programs. The results show that our parameterized heuristic algorithm was able to automatically infer new join points in subsequent versions with an average recall of 0.93. Moreover, these join points appeared, on average, in the top 4th percentile of the suggestions, indicating that the results were precise. %@ 978-0-7695-3891-4

@inproceedings{khatchadourian2009pointcut, abstract = {Pointcut fragility is a well-documented problem in Aspect-Oriented Programming; changes to the base-code can lead to join points incorrectly falling in or out of the scope of pointcuts. We present an automated approach that limits fragility problems by providing mechanical assistance in pointcut maintenance. The approach is based on harnessing arbitrarily deep structural commonalities between program elements corresponding to join points selected by a pointcut. The extracted patterns are then applied to later versions to offer suggestions of new join points that may require inclusion. We demonstrate the usefulness of our technique by rejuvenating pointcuts in multiple versions of several open-source AspectJ programs. The results show that our parameterized heuristic algorithm was able to automatically infer new join points in subsequent versions with an average recall of 0.93. Moreover, these join points appeared, on average, in the top 4th percentile of the suggestions, indicating that the results were precise.}, acmid = {1747559}, added-at = {2014-08-19T20:27:18.000+0200}, address = {Washington, DC, USA}, author = {Khatchadourian, Raffi and Greenwood, Phil and Rashid, Awais and Xu, Guoqing}, biburl = {https://www.bibsonomy.org/bibtex/2654640926671e6419fb67da2b9dbd9c0/jil}, booktitle = {Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering}, description = {Pointcut Rejuvenation}, doi = {10.1109/ASE.2009.37}, interhash = {f8b3c1b41c1364e1a7290f4d378998e9}, intrahash = {654640926671e6419fb67da2b9dbd9c0}, isbn = {978-0-7695-3891-4}, keywords = {aop induction pattern pointcut rejuvenation}, numpages = {5}, pages = {575--579}, publisher = {IEEE Computer Society}, series = {ASE '09}, timestamp = {2014-08-19T20:27:18.000+0200}, title = {Pointcut Rejuvenation: Recovering Pointcut Expressions in Evolving Aspect-Oriented Software}, url = {http://dx.doi.org/10.1109/ASE.2009.37}, year = 2009 }