Algebraic Specifications as Solutions of Implementation Equations
暂无分享,去创建一个
Algebraic specifications for datatypes are shown to be easy to write if succinct implementation descriptions are available. The method proposed solves out the implementation details, leaving behind the specification required. A number of examples illustrate the method. However it is also shown that in general the solution is not algorithmic. A connection to the correctness problem for implementations is made.
[1] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .
[2] M. E. Majster. Extended directed graphs, a formalism for structured data and data structures , 1977 .
[3] Samuel N. Kamin. Final Data Types and Their Specification , 1983, TOPL.
[4] Alfs T. Berztiss,et al. Specification and Implementation of Abstract Data Types , 1983, Adv. Comput..