A graph-based approach to modeling and detecting composition conflicts related to introductions

  • Authors:

  • Wilke Havinga;Istvan Nagy;Lodewijk Bergmans;Mehmet Aksit

  • Affiliations:

  • University of Twente, AE Enschede, The Netherlands;ASML Netherlands B.V., DR Veldhoven, The Netherlands;University of Twente, AE Enschede, The Netherlands;University of Twente, AE Enschede, The Netherlands

  • Venue:
  • Proceedings of the 6th international conference on Aspect-oriented software development
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The goal of this paper is to model and detect composition conflicts related to introductions. Within this context, we identify several categories of composition conflicts. To analyze the causes of these conflicts precisely, we first model the structure of programs as graphs. Next, we model introductions as graph transformation rules. We define explicit rules to describe when composition conflicts related to introductions occur. We built a prototype tool that detects and visualizes the occurrence of such conflicts in AspectJ programs, making use of an existing graph analysis and rewriting tool. The graph-based models are generated automatically from the source code of Java programs and AspectJ introductions. However, our approach does not make strong assumptions about either the aspect or base language; it has been designed to be applicable to other AOP languages.