Nederlands
Contact
Sitemap
Search
OrganisationEEMCS EPrints Service
 |
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
Havinga, W.K. and Nagy, I. and Bergmans, L.M.J. and Akşit, M.
(2007)
A Graph-based Approach to Modeling and Detecting Composition Conflicts Related to Introductions.
In: Proceedings of International Conference on Aspect Oriented Software Development, AOSD 2007, March 2007, Vancouver, Canada.
pp. 85-95.
ACM International Conference Proceedings Series.
ACM Press.
ISBN 1-59593-615-7
Full text available as:
Official URL: http://doi.acm.org/10.1145/1218563.1218574  AbstractThe 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.
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item |
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
|
|
|
|
|
||||||||||||||||||||||||||||||||
|
|
|
||||||||||||||||||||||||||||||||||
