| Abstract / Kurzbeschreibung: |
We examine four specification methods with increasing expressiveness. Parameterized recursion theory allows to characterize the power of parameterization in the methods, using a computational model based on Moschovakis' search computability. The four specification methods can be characterized by four different notions of semicomputable parameterized abstract data type, which differ in the availability of the parameter algebra and of nondeterminism. These characterizations further lead to different algebraic properties of specifiable PADTs. Together with example PADTs, they enable us to prove a hierarchy theorem. Given a sample PADT, the algebraic properties help to find out the lowest position (= most restricted method) in the hierarchy usable to specify it. This is important because the available tools may become weaker, if we choose a too general method. |
