β Scribed by A. Frick; G. Goos; R. Neumann; W. Zimmermann
No coin nor oath required. For personal study only.
This article discusses the problem of constructing robust class libraries. Further design criteria include the flexibility of class libraries, the efficiency of the implementations, and their safe extensibility. We show that it is possible to design robust libraries to satisfy any two of the requirements at the same time. Although the solution may require an exponential growth in the number of classes compared to the original design, this apparent class explosion can be controlled by generating only the necessary additional classes automatically. As an application demonstrating both the theoretical problems and the power of our generator approach, the design of a library modelling data structures and algorithms for graphs is considered. Both the discussion and the results in this article generalize to other domains.
π SIMILAR VOLUMES
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 related structures are presented as a framework for dealing with the design and maintenance of class hierarchies. Beca
## Abstract We give a simple and elementary proof of the following result of Girard and Vauzeilles which is proved in [5]: βThe binary Veblen function Ο: __On Γ On β On__ is a dilator.β Our proof indicates the intimate connection between the traditional theory of ordinal notation systems and Girard
## Abstract We present two results which shed some more light on the deep connection between ZFA and the standard ZF set theory: First of all we refine a result of Forti and Honsell (see [5]) in order to prove that the universe of ZFA can also be obtained (without appealing to choice) as the least
This paper is concerned with a study of robust estimation in principal component analysis. A class of robust estimators which are characterized as eigenvectors of weighted sample covariance matrices is proposed, where the weight functions recursively depend on the eigenvectors themselves. Also, a fe
We find a natural construction of a large class of symmetric graphs from point-and block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B, C of B, eithe