Lessons Learned in Applying Formal Concept Analysis

Arévalo, Gabriela; Ducasse, Stéphane; Nierstrasz, Oscar (February 2005). Lessons Learned in Applying Formal Concept Analysis. Lecture notes in computer science, 3403, pp. 95-112. Springer 10.1007/b105806

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

Download (327kB) | Request a copy

A key difficulty in the maintenance and evolution of complex software systems is to recognize and understand the implicit dependencies that define contracts that must be respected by changes to the software. Formal Concept Analysis is a well-established technique for identifying groups of elements with common sets of properties. We have successfully applied FCA to complex software systems in order to automatically discover a variety of different kinds of implicit, recurring sets of dependencies amongst design artifacts. In this paper we describe our approach, outline three case studies, and draw various lessons from our experiences. In particular, we discuss how our approach is applied iteratively in order to draw the maximum benefit offered by FCA.

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:

Ducasse, Stephane and Nierstrasz, Oscar Marius

Subjects:

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

ISSN:

0302-9743

Series:

LNAI (Lecture Notes in Artificial Intelligence)

Publisher:

Springer

Language:

English

Submitter:

Manuela Bamert

Date Deposited:

30 Oct 2017 12:03

Last Modified:

02 Nov 2017 05:28

Publisher DOI:

10.1007/b105806

BORIS DOI:

10.7892/boris.104378

URI:

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

Actions (login required)

Edit item Edit item
Provide Feedback