Software reengineering based on concept lattices

Concept analysis provides a way to identify groupings of objects that have common attributes. The mathematical foundation was laid by G. Birkhoff (1940), who proved that, for every binary relation between certain “objects” and “attributes”, a lattice can be constructed which allows remarkable insight into the structure of the original relation. The relation can always be reconstructed from the lattice, hence concept analysis is similar in spirit to Fourier analysis. R. Wille (1982) and B. Ganter et al. (1999) elaborated Birkhoff´s result and transformed it into a data analysis method that has found a variety of applications, such as an analysis of Rembrandt´s paintings, a classification of algebraic structures and the behaviour of drug addicts. In 1993, work on the application of concept analysis in the area of program understanding and reengineering was initiated. Concept analysis has been used for modularization of legacy code, finding interferences between configurations and transformation of class hierarchies. Recently, concept lattices have also been applied to analysis of dynamic program behaviour. In this paper, we do not present the mathematical and algorithmic background but merely present an example explaining concept lattices