Limits of the "algebraic" specification of abstract data types
- 1 October 1977
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 12 (10), 37-42
- https://doi.org/10.1145/954627.954630
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Extended directed graphs, a formalism for structured data and data structuresActa Informatica, 1977
- Specification techniques for data abstractionsIEEE Transactions on Software Engineering, 1975
- The verification and synthesis of data structuresActa Informatica, 1975
- Programming with abstract data typesPublished by Association for Computing Machinery (ACM) ,1974
- Types are not setsPublished by Association for Computing Machinery (ACM) ,1973
- A technique for software module specification with examplesCommunications of the ACM, 1972
- Proof of correctness of data representationsActa Informatica, 1972
- Toward an understanding of data structuresCommunications of the ACM, 1971
- Data graphs and addressing schemesJournal of Computer and System Sciences, 1971