Tien Chau - Academia.edu (original) (raw)
Uploads
Papers by Tien Chau
Logiciel, Base De Données, Réseaux / Software, Databases, Networks, 1999
Plusieurs algorithmes ont été proposés pour la construction de hiérarchies de classes à partir de... more Plusieurs algorithmes ont été proposés pour la construction de hiérarchies de classes à partir de la spécification de leurs propriétés. Entre autres, les algorithmes proposés dans [Dicky 1994] et [Godin 1995a] préservent la structure de sous-hiérarchie de Galois de la relation entre les classes et leurs propriétés. De plus ces algorithmes peuvent incorporer de nouvelles classes à une hiérarchie existante. Le résultat est une hiérarchie qui garantit la factorisation maximale des propriétés et la conformité avec la relation de spécialisation entre les classes. Les deux algorithmes ont été implémentés dans un environnement commun afin de comparer leurs performances. Les résultats d'expériences sont rapportés et analysés. ABSTRACT. Many algorithms are proposed for building class hierarchies from the specification of their properties. Among those, the algorithms proposed in [Dicky 1994] and [Godin 1995a] preserve the Galois sub-hierarchy of the relationship between the classes and their properties. Furthermore, the algorithms are incremental and can therefore incorporate a new class within an existing hierarchy. The result is a hierarchy that guarantees the maximal factorization of the properties and conformity to the specialization relationship between classes. Both algorithms are implemented in a common environment and their performance is compared. The results of experiments are reported and analyzed. MOTS-CLÉS : sous-hiérarchie de Galois, algorithme, conception de hiérarchie de classes KEY WORDS: Galois sub-hierarchy, algorithm, class hierarchy design.
Theory and Practice of Object Systems, 1998
Building and maintaining the class hierarchy has been recognized as an important but one of the m... more Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices and variant structures are presented as a framework for dealing with the design and maintenance of class hierarchies. Because the design of class hierarchies is inherently an iterative and incremental process, we designed incremental algorithms that update existing Galois lattices as the result of adding, removing, or modifying class specifications. A prototype tool incorporating this and other algorithms has been developed as part of the IGLOO project, which is a large object-oriented software engineering joint research project involving academic and industrial partners. The tool can generate either the concept lattice or several variant structures incrementally by incorporating new classes one by one. The resulting hierarchies can be interactively explored and refined using a graphical browser. In addition, several metrics are computed to help evaluating the quality of the hierarchies. Experiments are presented to better assess the applicability of the approach.
Logiciel, Base De Données, Réseaux / Software, Databases, Networks, 1999
Plusieurs algorithmes ont été proposés pour la construction de hiérarchies de classes à partir de... more Plusieurs algorithmes ont été proposés pour la construction de hiérarchies de classes à partir de la spécification de leurs propriétés. Entre autres, les algorithmes proposés dans [Dicky 1994] et [Godin 1995a] préservent la structure de sous-hiérarchie de Galois de la relation entre les classes et leurs propriétés. De plus ces algorithmes peuvent incorporer de nouvelles classes à une hiérarchie existante. Le résultat est une hiérarchie qui garantit la factorisation maximale des propriétés et la conformité avec la relation de spécialisation entre les classes. Les deux algorithmes ont été implémentés dans un environnement commun afin de comparer leurs performances. Les résultats d'expériences sont rapportés et analysés. ABSTRACT. Many algorithms are proposed for building class hierarchies from the specification of their properties. Among those, the algorithms proposed in [Dicky 1994] and [Godin 1995a] preserve the Galois sub-hierarchy of the relationship between the classes and their properties. Furthermore, the algorithms are incremental and can therefore incorporate a new class within an existing hierarchy. The result is a hierarchy that guarantees the maximal factorization of the properties and conformity to the specialization relationship between classes. Both algorithms are implemented in a common environment and their performance is compared. The results of experiments are reported and analyzed. MOTS-CLÉS : sous-hiérarchie de Galois, algorithme, conception de hiérarchie de classes KEY WORDS: Galois sub-hierarchy, algorithm, class hierarchy design.
Theory and Practice of Object Systems, 1998
Building and maintaining the class hierarchy has been recognized as an important but one of the m... more Building and maintaining the class hierarchy has been recognized as an important but one of the most difficult activities of object-oriented design. Concept (or Galois) lattices and variant structures are presented as a framework for dealing with the design and maintenance of class hierarchies. Because the design of class hierarchies is inherently an iterative and incremental process, we designed incremental algorithms that update existing Galois lattices as the result of adding, removing, or modifying class specifications. A prototype tool incorporating this and other algorithms has been developed as part of the IGLOO project, which is a large object-oriented software engineering joint research project involving academic and industrial partners. The tool can generate either the concept lattice or several variant structures incrementally by incorporating new classes one by one. The resulting hierarchies can be interactively explored and refined using a graphical browser. In addition, several metrics are computed to help evaluating the quality of the hierarchies. Experiments are presented to better assess the applicability of the approach.