Towards the Temporal Approach to Abstract Data Types

1988 ◽  
Vol 11 (1) ◽  
pp. 49-63
Author(s):  
Andrzej Szalas

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.

1996 ◽  
Vol 3 (52) ◽  
Author(s):  
Claus Hintermeier ◽  
Hélene Kirchner ◽  
Peter D. Mosses

Specification frameworks such as B and Z provide power sets and cartesian<br />products as built-in type constructors, and employ a rich notation for<br />defining (among other things) abstract data types using formulae of predicate<br />logic and lambda-notation. In contrast, the so-called algebraic specification <br />frameworks often limit the type structure to sort constants and<br />first-order functionalities, and restrict formulae to (conditional) equations.<br />Here, we propose an intermediate framework where algebraic specifications<br />are enriched with a set-theoretic type structure, but formulae remain in the<br />logic of equational Horn clauses. This combines an expressive yet modest<br />specification notation with simple semantics and tractable proof theory.


1987 ◽  
Vol 22 (4) ◽  
pp. 103-110 ◽  
Author(s):  
J D Eckart

2007 ◽  
Vol 17 (3) ◽  
pp. 183-203 ◽  
Author(s):  
Borislav Nikolik ◽  
Dick Hamlet

1981 ◽  
Vol 11 (2) ◽  
pp. 203-206
Author(s):  
Hartmut H. Wedekind

1975 ◽  
Vol 10 (7) ◽  
pp. 25-29 ◽  
Author(s):  
Jack B. Dennis

Sign in / Sign up

Export Citation Format

Share Document