Towards the Temporal Approach to Abstract Data Types

Article type: Research Article

Authors: Szalas, Andrzej^{a; b}

Affiliations: [a] Institute of Informatics, University of Warsaw, 00-901 Warsaw, Poland | [b] Department of Computing, Imperial College, London SW7 2BZ, England

Abstract: In this paper we deal with a well known problem of specifying abstract data types. Up to now there were many approaches to this problem. We follow the axiomatic style of specifying abstract data types (cf. e.g. [1, 2, 6, 8, 9, 10]). We apply, however, the first-order temporal logic. We introduce a notion of first-order completeness of axiomatic specifications and show a general method for obtaining first-order complete axiomatizations. Some examples illustrate the method.

Keywords: abstract data type, consistency, first-order completeness, representation theorem, temporal logic

DOI: 10.3233/FI-1988-11105

Journal: Fundamenta Informaticae, vol. 11, no. 1, pp. 49-63, 1988