Systematic design of algebraic specifications
Sergio Antoy · 1989
Underand over-specification of abstract data types are conditions resulting from "flawed" equations in alge-bra& specifications.Two design strategies, the bintrry choice method and the notion of recursive reduction, are introduced for designing specifications which satisfy desirable properties of completeness, parsimony, and termination through which we address the above conditions.A number of results concerning these strategies are presented.Several examples are discussed and an implementation of these ideas is outlined.