Home > Research > Publications & Outputs > Detecting broken pointcuts using structural com...

Links

Text available via DOI:

View graph of relations

Detecting broken pointcuts using structural commonality and degree of interest

Research output: Contribution to journalJournal article

E-pub ahead of print
  • Raffi Khatchadourian
  • Awais Rashid
  • Hidehiko Masuhara
  • Takuya Watanabe
Close
<mark>Journal publication date</mark>29/06/2017
<mark>Journal</mark>Science of Computer Programming
<mark>State</mark>E-pub ahead of print
Early online date29/06/17
<mark>Original language</mark>English

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. Deciding which pointcuts have broken due to base-code changes is a daunting venture, especially in large and complex systems. We present an automated approach that recommends pointcuts that are likely to require modification due to a particular base-code change, as well as ones that do not. Our hypothesis is that join points selected by a pointcut exhibit common structural characteristics. Patterns describing such commonality are used to recommend pointcuts that have potentially broken with a degree of confidence as the developer is typing. The approach is implemented as an extension to the popular Mylyn Eclipse IDE plug-in, which maintains focused contexts of entities relevant to the task at hand using a Degree of Interest (DOI) model. We show that it is accurate in revealing broken pointcuts by applying it to multiple versions of several open source projects and evaluating the quality of the recommendations produced against actual modifications. We found that our tool made broken pointcuts 2.14 times more interesting in the DOI model than unbroken ones, with a p-value under 0.1, indicating a significant difference in final DOI value between the two kinds of pointcuts (i.e., broken and unbroken).

Bibliographic note

This is the author’s version of a work that was accepted for publication in Science of Computer Programming. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Science of Computer Programming, ??, ?, 2017 DOI: 10.1016/j.scico.2017.06.011