Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Compatibility problems in the development of algebraic module specifications
Ehrig H., Fey W., Hansen H., Löwe M., Jacobs D., Parisi-Presicce F. Theoretical Computer Science77 (1-2):27-71,1990.Type:Article
Date Reviewed: Oct 1 1991

Reporting on an extended project concerning modularized software development, the authors present a number of  theorems  related to the compatibility of specifications generated at various steps in the development and refinement of software systems. The work relates to a particular specification technique using a module concept based on initial algebra semantics. The report includes detailed reviews of the module concept; operations for module structuring, refinement, and realization; and the categorical framework employed. On this basis, a proof is given of a general theorem establishing the compatibility of the operations employed in the technique.

While the resulting theorem may be correct as it stands, the presentation and the overall argument are entirely unsatisfactory. The techniques are given in such a breezy style that the reader is left wondering who is supposed to do what.

The introduction starts by talking about the design and implementation of large software systems, and refers to a number of programming languages that provide facilities for handling modules. One page into the introduction, however, the aim shifts: “the main aim of this paper is to present a categorical framework for all kinds of compatibility problems….” This raises the question of what is gained by using a categorical framework in this context, as compared to what has been used by other authors. The authors neither ask nor answer this question. The whole work is thus reduced to an arid exercise in formal algebra. In this exercise, the word “correct” is used with a formally defined meaning; no attempt is made to relate it to such intuitive notions as are invoked.

To this exercise the authors then add a few remarks relating to informal issues, but these largely take the form of unsupported and misleading claims. For example, they suggest in Section 1.1 that proofs depend on the concepts being expressed within a formal syntax and semantics. This would invalidate many of the proofs given in the report, which depend on the reader’s insight into the figures shown.

The problems of modularized software development are undoubtedly in great need of systematic study. Unfortunately, the authors confine their attention to formality and superficial claims. They do not contribute to our insight.

Reviewer:  P. Naur Review #: CR115131
Bookmark and Share
 
Specification Techniques (F.3.1 ... )
 
 
Algebraic Language Theory (F.4.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Specification Techniques": Date
Transformations of sequential specifications into concurrent specifications by synchronization guards
Janicki R., Müldner T. Theoretical Computer Science 77(1-2): 97-129, 1990. Type: Article
Jul 1 1991
Regularity of relations
Jaoua A., Mili A., Boudriga N., Durieux J. Theoretical Computer Science 79(2): 323-339, 1991. Type: Article
Apr 1 1992
Building specifications in an arbitrary institution
Sannella D., Tarlecki A. (ed)  Semantics of data types (, Sophia-Antipolis, France, Jun 27-29, 1984)3561984. Type: Proceedings
May 1 1985
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy