Aspect Mining Using Relative Reduced Concept Lattice
Crosscutting concerns cannot be well modularized in object-oriented software. The implementation of a crosscutting concern is typically scattered over many locations and tangled with the implementation of other concerns. The presence of crosscutting concerns is one of the major problems in software understanding and evolution. Aspect-oriented programming offers mechanisms to factor them out into a modular unit, called an aspect Aspect mining tries to identify crosscutting concerns in legacy systems and thus supports the adaptation to an aspectoriented design. This paper presents an automatic static aspect mining approach that relies on the relative reduced concept lattice. It uses method call tree to describe the relationship between class methods. The method call trees are then subjected to concept analysis. In the resulting relative reduced concept lattice, candidate aspects are detected. An experimental evaluation shows that the approach has a higher automation degree and faster mining rate.
aspect mining relative reduced concept lattice method call tree
Liping Qu Guisheng Yin Jing Yang Xiaoyu Hou
Computer Science and Technology Institute Harbin Engineering University Harbin, Heilongjiang Province, China
国际会议
上海
英文
183-187
2011-03-11（万方平台首次上网日期，不代表论文的发表时间）