抽象的인 데이타形態의 代數的 明細와 實行 = The Algebraic Specifications and Implementations of Abstract Data Types

다국어 초록 (Multilingual Abstract)

The data type abstraction is a representation-independent formal specification of data and comprises a group of related functions or operations that act upon a particular class of objects, with the constraint that the behavior of the objects can be observed only by applications of the operations. The uses of the specification are in organizing large systems and in proving the correctness of implementations.
Up to the present, many papers have concerned with the data type specifications of stack, queue, graph, binary tree, etc. The purpose of this thesis is to represent the algebraic specifications and implementations of B tree and network based on the above basic data types. These specifications can be devided by two parts. One part concerns with the identification of the abstraction being defined and its domain. The other describes the semantics of the operations which informs about the actual meaning or behaviors of the data abstraction.