000			02180naa a2200253 a 4500
003			AR-LpUFIB
005			20250311170249.0
008			230201s2005 xx o 000 0 eng d
024	8		_aDIF-M2705 _b2797 _zDIF002612
040			_aAR-LpUFIB _bspa _cAR-LpUFIB
100	1		_aLienhard, Adrian
245	1	0	_aIdentifying traits with formal concept analysis
490	0		_a^p Datos electrónicos (1 archivo : 210 KB)
500			_aFormato de archivo: PDF. -- Este documento es producción intelectual de la Facultad de Informática-UNLP (Colección BIPA / Biblioteca.) -- Disponible también en línea (Cons. 30/03/2009)
520			_aTraits are basically mixins or interfaces but with method bodies. In languages that support traits, classes are composed out of traits. There are two main advantages with traits. Firstly, decomposing existing classes into traits from which they can be recomposed improves the factoring of hierarchies. Secondly it increases the library reuse potential by providing more reusable traits. Identifying traits and decomposing class hierarchies into traits is therefore an important and challenging task to facilitate maintainability and evolution. In this paper we present how we use Formal Concept Analysis to identify traits in inheritance hierarchies. Our approach is two-staged: first we identify within a hierarchy maximal groups of methods that have a set of classes in common, second we cluster cohesive groups of methods based on method invocations as potential traits. We applied our approach on two significant hierarchies and compare our results with the manual refactorization of the same code which was done by the authors of traits. -- Kewyords: Traits, Mixins, Formal Concept Analysis, Logical Views.
534			_aProceedings of ASE ’05 (20th Conference on Automated Software Engineering), 62–71, IEEE Computer Society Press, 2005.
650		4	_aMANTENIMIENTO DE SOFTWARE
650		4	_aANÁLISIS FORMAL DE CONCEPTOS
650		4	_aPROGRAMACIÓN ORIENTADA A OBJETOS
700	1		_aDucasse, Stéphane
700	1		_aArévalo, Gabriela Beatriz
856	4	0	_uwww.lifia.info.unlp.edu.ar/papers/2005/Lienhard2005.pdf
942			_cCP
999			_c52489 _d52489