Identifying Traits with Formal Concept Analysis

Lienhard, Adrian; Ducasse, Stéphane; Arévalo, Gabriela (November 2005). Identifying Traits with Formal Concept Analysis. In: 20th IEEE/ACM international Conference on Automated software engineering (p. 66). IEEE Computer Society 10.1145/1101908.1101921

[img] Text
Lien05aIdentifyingTraits.pdf - Published Version
Restricted to registered users only
Available under License Publisher holds Copyright.

Download (214kB) | Request a copy

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.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

08 Faculty of Science > Institute of Computer Science (INF)
08 Faculty of Science > Institute of Computer Science (INF) > Software Composition Group (SCG)

UniBE Contributor:

Lienhard, Adrian and Ducasse, Stephane

Subjects:

000 Computer science, knowledge & systems
500 Science > 510 Mathematics

ISBN:

1-58113-993-4

Publisher:

IEEE Computer Society

Language:

English

Submitter:

Manuela Bamert

Date Deposited:

18 Oct 2017 15:57

Last Modified:

23 Oct 2017 16:47

Publisher DOI:

10.1145/1101908.1101921

BORIS DOI:

10.7892/boris.104597

URI:

https://boris.unibe.ch/id/eprint/104597

Actions (login required)

Edit item Edit item
Provide Feedback