Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms
LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, France;
2 LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, France; (email@example.com)
3 LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, France; (firstname.lastname@example.org)
Accepted: March 2001
In the context of object-oriented systems, algorithms for building class hierarchies are currently receiving much attention. We present here a characterization of several global algorithms. A global algorithm is one which starts with only the set of classes (provided with all their properties) and directly builds the hierarchy. The algorithms scrutinized were developped each in a different framework. In this survey, they are explained in a single framework, which takes advantage of a substructure of the Galois lattice associated with the binary relation mapping the classes to their properties. Their characterization allows to figure the results of the algorithms without running them in simple cases. This study once again highlights the Galois lattice as a main and intuitive model for class hierarchies.
Mathematics Subject Classification: 06A15
Key words: Object-oriented systems / class hierarchy / Galois lattice / class hierarchy construction algorithms.
© EDP Sciences, 2000