Identifying traits with formal concept analysis

Detalles Bibliográficos
Autor Principal: Lienhard, Adrian
Otros autores o Colaboradores: Ducasse, Stéphane, Arévalo, Gabriela Beatriz
Formato: Capítulo de libro
Lengua:inglés
Series:^p Datos electrónicos (1 archivo : 210 KB)
Temas:
Acceso en línea:www.lifia.info.unlp.edu.ar/papers/2005/Lienhard2005.pdf
Consultar en el Cátalogo
Resumen:Traits 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.
Notas:Formato 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)

MARC

LEADER 00000naa a2200000 a 4500
003 AR-LpUFIB
005 20250423183005.0
008 230201s2005 xx o 000 0 eng d
024 8 |a DIF-M2705  |b 2797  |z DIF002612 
040 |a AR-LpUFIB  |b spa  |c AR-LpUFIB 
100 1 |a Lienhard, Adrian  |9 46477 
245 1 0 |a Identifying traits with formal concept analysis 
490 0 |a ^p Datos electrónicos (1 archivo : 210 KB) 
500 |a Formato 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 |a Traits 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 |a Proceedings of ASE ’05 (20th Conference on Automated Software Engineering), 62–71, IEEE Computer Society Press, 2005. 
650 4 |a MANTENIMIENTO DE SOFTWARE  |9 43117 
650 4 |a ANÁLISIS FORMAL DE CONCEPTOS  |9 46151 
650 4 |a PROGRAMACIÓN ORIENTADA A OBJETOS  |9 42796 
700 1 |a Ducasse, Stéphane  |9 46154 
700 1 |a Arévalo, Gabriela Beatriz  |9 45006 
856 4 0 |u www.lifia.info.unlp.edu.ar/papers/2005/Lienhard2005.pdf 
942 |c CP 
952 |0 0  |1 0  |4 0  |6 A0182  |7 3  |8 BD  |9 77081  |a DIF  |b DIF  |d 2025-03-11  |l 0  |o A0182  |r 2025-03-11 17:02:49  |u http://catalogo.info.unlp.edu.ar/meran/getDocument.pl?id=187  |w 2025-03-11  |y CP 
999 |c 52489  |d 52489