A technique for software module specification with examples
Communications of the ACM
Toward an understanding of data structures
Communications of the ACM
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Programming with abstract data types
Proceedings of the ACM SIGPLAN symposium on Very high level languages
Trace Specifications: Methodology and Models
IEEE Transactions on Software Engineering
Journal of the ACM (JACM)
On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
Journal of the ACM (JACM)
Data Type Specification: Parameterization and the Power of Specification Techniques
ACM Transactions on Programming Languages and Systems (TOPLAS)
Final Data Types and Their Specification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Algebraic specifications: some old history and new thoughts
Nordic Journal of Computing
Data type specification: Parameterization and the power of specification techniques
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Logical Structure Specification and data type definition
ACM '79 Proceedings of the 1979 annual conference
ACM SIGPLAN Notices
A note on some limits of the algebraic specification method
ACM SIGPLAN Notices
On a finite axiomatization of the data type L
ACM SIGPLAN Notices
Traversable stack with fewer errors
ACM SIGPLAN Notices
ACM SIGPLAN Notices
On the adequacy of finite equational methods for data type specification
ACM SIGPLAN Notices
Some definitions for algebraic data type specifications
ACM SIGPLAN Notices
Specifications of Majster's traversable stack and Veloso's traversable stack
ACM SIGPLAN Notices
Specifying abstract data types by restriction
ACM SIGSOFT Software Engineering Notes
Behavioral abstraction is hiding information
Theoretical Computer Science - Selected papers of CMCS'03
Synthesizing intensional behavior models by graph transformation
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
| Hi-index | 0.00 |
This 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 cannot be applied.