DocumentCode
545421
Title
Aspect mining using relative reduced concept lattice
Author
Qu, Liping ; Yin, Guisheng ; Yang, Jing ; Hou, Xiaoyu
Author_Institution
Comput. Sci. & Technol. Inst., Harbin Eng. Univ., Harbin, China
Volume
2
fYear
2011
fDate
11-13 March 2011
Firstpage
183
Lastpage
187
Abstract
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 aspect-oriented 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.
Keywords
aspect-oriented programming; data mining; formal concept analysis; object-oriented methods; software maintenance; aspect oriented design; aspect oriented programming; automatic static aspect mining approach; legacy system; object oriented software; relative reduced concept lattice; Algorithm design and analysis; Arrays; Context; Control systems; Data mining; Generators; Lattices; aspect mining; method call tree; relative reduced concept lattice;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Research and Development (ICCRD), 2011 3rd International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-61284-839-6
Type
conf
DOI
10.1109/ICCRD.2011.5764110
Filename
5764110
Link To Document