Issue No.12 - December (1987 vol.13)
N.Y. Foo , Department of Computer Science, University of Sydney
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.
unification, Abstraction, algebraic specification, datatype, implementation correctness
N.Y. Foo, "Algebraic Specifications as Solutions of Implementation Equations", IEEE Transactions on Software Engineering, vol.13, no. 12, pp. 1364-1369, December 1987, doi:10.1109/TSE.1987.233146