Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Comorphisms of structured institutions
Ţuţu I. Information Processing Letters113 (22-24):894-900,2013.Type:Article
Date Reviewed: Dec 11 2013

Once upon a time, programmers talked to their clients. Later, they were given a written specification instead. These specifications became standardized with special forms and formats. Academics explored special logics to use in them. Goguen and Burstall proved that all these logics could be described in the abstract entity referred to in the title of this paper: the institution [1]. Their definition is reiterated in this paper.

Briefly, an institution has a specialized vocabulary (symbols and sentences) that expresses properties applying to a set of models. A satisfaction relation connects models to sentences. Category theory expresses the necessary axioms. This paper adds another layer of abstraction that covers most ways of composing and structuring specifications. It (of course) uses category theory and is incomprehensible without it.

The paper is short, clear, and to the point. It may lead researchers to better specification languages. However, I don’t expect it to change mainstream software development, which has ignored or distorted formal logic. The trend is to return to working with clients unencumbered by paperwork and formulae.

Reviewer:  Richard Botting Review #: CR141796 (1402-0142)
1) Goguen, J. A.; Burstall, R. M. Institutions: abstract model theory for specification and programming. Journal of the ACM 39, 1(1992), 95–146.
Bookmark and Share
  Featured Reviewer  
 
Specification Techniques (F.3.1 ... )
 
 
Formal Methods (D.2.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Specification Techniques": Date
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 Science 77(1-2): 27-71, 1990. Type: Article
Oct 1 1991
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
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