Results 91 to 95 of about 46,991 (95)
Some of the next articles are maybe not open access.
1981
A generalization of our terminal algebra semantics approach is presented. We then give a uniform initial/terminal semantics of parameterized data type specifications.
Günter Hornung, Peter Raulefs
openaire +1 more source
A generalization of our terminal algebra semantics approach is presented. We then give a uniform initial/terminal semantics of parameterized data type specifications.
Günter Hornung, Peter Raulefs
openaire +1 more source
Limits of the "algebraic" specification of abstract data types
ACM SIGPLAN Notices, 1977This paper deals with the feasibility of the algebraic specification technique for abstract data types, which consists of a declaration of the operations of a data type and a finite set of "axioms" for the operations. We discuss some inherent difficulties arising from this technique and present a simple example of an abstract type for which the method ...
openaire +1 more source
2012 IEEE 25th Conference on Software Engineering Education and Training, 2012
This Work in Progress report presents an educational software tool for testing abstract data types implemented in C++ against formal algebraic specifications written in Maude, a formal specification language based on rewriting logic that allows the specification of abstract data types in a clear and concise manner.
openaire +1 more source
This Work in Progress report presents an educational software tool for testing abstract data types implemented in C++ against formal algebraic specifications written in Maude, a formal specification language based on rewriting logic that allows the specification of abstract data types in a clear and concise manner.
openaire +1 more source
On Algebraic Specifications of Abstract Data Types
2003In this paper we address long standing open problems of Bergstra and Tucker about specifications of abstract data types by means of equations and conditional equations. By an abstract data type we mean the isomorphism type of an algebra. An algebra is algebraically specified if the algebra can be defined uniquely, in a certain precise sense, in terms ...
openaire +1 more source
Procedural implementation of algebraic specifications of abstract data types
1987In recent years the concept of abstract data types (ADT) [I], which makes use of a specification of data by defining abstract (i. e~ not connected with a real represantation of data in a memory of a computer) properties of data used in a program, is actively developed.
openaire +1 more source