Constructing Specification Morphisms (1993)
| Venue: | Journal of Symbolic Computation |
| Citations: | 36 - 4 self |
BibTeX
@ARTICLE{Smith93constructingspecification,
author = {Douglas R. Smith},
title = {Constructing Specification Morphisms},
journal = {Journal of Symbolic Computation},
year = {1993},
volume = {15},
pages = {5--6}
}
Years of Citing Articles
OpenURL
Abstract
This paper is part of a broader research program to explore a mechanizable model of software development based on algebraic specifications and specification morphisms. An algebraic specification (or simply a specification) defines a language and constrains its possible meanings via axioms and inference rules. Specifications can be used to express many kinds of software-related artifacts, including domain models (Srinivas(1991)), formal requirements (Astesiano and Wirsing (1987), Ehrig and Mahr (1990), Partsch (1990), Sannella and Tarlecki (1985)), programming languages (Broy et al. (1987), Goguen and Winkler (1988), Hoare (1989)), abstract data types (Goguen et al. (1978), Guttag and Horning (1978)), and abstract algorithms (Smith and Lowry (1990)). There has been much work on operations for constructing larger specifications from smaller specifications (Astesiano and Wirsing (1987), Burstall and Goguen (1977), Sannella and Tarlecki (1988)). A specification morphism translates the language of one specification into the language of another specification in a way that preserves theorems. Specification morphisms underlie several aspects of software development, including specification refine-







