Ahn Hi Suck, Jun Moon Seog, Rhew Sung Yul

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 2, No. 4, pp. 477-486, Jul. 1995
10.3745/KIPSTE.1995.2.4.477,   PDF Download:

Abstract

This paper describes and constructs object-oriented analysis models using Galois-lattices that we are always studying in discrete mathematics, shows fundamental approaches to maintain the models, analyzes the construction of object-oriented analysis models through good examples. Also, we define several properties of Galois-lattices that have binary relations between class objects, propose the incremental updating algorithms that can update the Galois-lattice whenever new classes are added. This proposal shows that in case of adding new class nodes the results from simulations can implement in constant time and have linearly the incremental structures in worst cases, and in that the growth rate of lattices is proportioned to class nodes in time complexity. This results can achieve the high understandability of object-oriented analysis models and the high traceability of maintenance models. Furthermore, it is possible to make more efficient performances of class reusability in advantages of object-oriented systems and support truly the class hierarchical maintenances.

Statistics
Cite this article