Toward formal development of programs from algebraic specifications: Implementations revisited |
| |
Authors: | Donald Sannella and Andrzej Tarlecki |
| |
Affiliation: | (1) Department of Artificial Intelligence, University of Edinburgh and Laboratory for Foundations of Computer Science, EH93JZ Edingburgh, UK;(2) Department of Computer Science, University of Edinburgh, EH93JZ Edingburgh, UK;(3) Institute of Computer Science, Polish Academy of Sciences, Warsaw, Poland |
| |
Abstract: | Summary The program development process is viewed as a sequence of implementation steps leading from a specification to a program. Based on an elementary notion of refinement, two notions of implementation are studied: constructor implementations which involve a construction “on top of” the implementing specification, and abstractor implementations which additionally provide for abstraction from some details of the implemented specification. These subsume most formal notions of implementation in the literature. Both kinds of implementations satisfy a vertical composition and a (modified) horizontal composition property. All the definitions and results are shown to generalise to the framework of an arbitrary institution, and a way of changing institutions during the implementation process is introduced. All this is illustrated by means of simple concrete examples. An extended abstract of this paper appeared in [65]. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|