Hostname: page-component-76fb5796d-45l2p Total loading time: 0 Render date: 2024-04-30T04:24:54.071Z Has data issue: false hasContentIssue false
  • English
  • Français

Galois Lattice as a Framework to Specify Building Class Hierarchies Algorithms

Published online by Cambridge University Press:  15 April 2002

M. Huchard ,
H. Dicky  and
H. Leblanc
M. Huchard
Affiliation:
LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, France; (huchard@lirmm.fr)
H. Dicky
Affiliation:
LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, France; (dicky@lirmm.fr)
H. Leblanc
Affiliation:
LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, France; (leblanc@lirmm.fr)
Get access

Abstract

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.

Keywords

Object-oriented systemsclass hierarchyGalois latticeclass hierarchy construction algorithms.
Type
Research Article
Information
RAIRO - Theoretical Informatics and Applications , Volume 34 , Issue 6 , November 2000 , pp. 521 - 548
Copyright
© EDP Sciences, 2000

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

M. Barbut and B. Monjardet, Ordre et classification : Algèbre et combinatoire. Hachette (1970).
J.-B. Chen and S.C. Lee, Generation and reorganization of subtype hierarchies. J. Object Oriented Programming 8 (1996).
N. Chevalier, M. Dao, C. Dony, M. Huchard, H. Leblanc and T. Libourel, An environment for building and maintaining class hierarchies, in ECOOP 99 Workshop - Object-Oriented Architectural Evolution (1999).
W.R. Cook, Interfaces and Specifications for the Smalltalk-80 Collection Classes, in Special issue of Sigplan Notice - Proceedings of ACM OOPSLA'92 (1992) 1-15.
B.A. Davey and H.A. Priestley, Introduction to Lattices and Orders. Cambridge University Press (1990).
H. Dicky, C. Dony, M. Huchard and T. Libourel, On automatic class insertion with overloading, Special issue of Sigplan Notice - Proceedings of ACM OOPSLA'96, Vol. 31 (1996) 251-267.
R. Godin and H. Mili, Building and Maintaining Analysis-Level Class Hierarchies Using Galois Lattices, in Special issue of Sigplan Notice - Proceedings of ACM OOPSLA'93, Vol. 28 (1993) 394-410.
R. Godin, H. Mili, G. Mineau and R. Missaoui, Conceptual Clustering methods based on Galois lattices and applications. Revue d'intelligence artificielle 9 (1995).
R. Godin, G. Mineau and R. Missaoui, Incremental structuring of knowledge bases, in Proc. of International KRUSE symposium: Knowledge Retrieval, Use, and Storage for Efficiency. Springer-Verlag, Lecture Notes in Artificial Intelligence 9 (1995) 179-198.
R. Godin, H. Mili, G. Mineau, R. Missaoui, A. Arfi and T.T. Chau, Design of Class Hierarchies Based on Concept (Galois) Lattices. Theory And Practice of Object Systems 4 (1998).
M. Huchard and H. Leblanc, Computing Interfaces in Java, in Proc. of IEE International conference on Automated Software Engineering (ASE'2000). Grenoble, France (2000) 317-320.
K.J. Lieberherr, P. Bergstein and I. Silva-Lepe, From objects to classes: Algorithms for optimal object-oriented design. J. Software Engrg. (1991) 205-228.
G. Mineau, J. Gecsei and R. Godin, Structuring Knowledge Bases Using Automatic Learning, in Proc. of the sixth International Conference on Data Engineering (1990) 274-280.
I. Moore and T. Clement, A Simple and Efficient Algorithm for Inferring Inheritance Hierarchies, in TOOLS Europe 1996 Proceedings. Prentice-Hall (1996).
B. Stroustrup, The C++ programming language, third edition. Addison-Wesley (1998).
R. Wille, Restructuring lattice theory: An approach based on hierarchies of concepts, Ordered Sets, edited by I. Rivals (1982) 23.