H. Dicky

H. Dicky

Auto-generated profile, based on publicly available information

H. Dicky

LIRMM, 161 rue Ada, 34392 Montpellier cedex 5, France

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2000 in RAIRO - Theoretical Informatics and Applications
Verified
Journal Article
Open access
PDF file
MHMarianne Huchard
Marianne Huchard
HDH. Dicky
H. Dicky
HLH. Leblanc
H. Leblanc
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.