Abstract data types and the development of data structures

Authors:
John Guttag
Affiliations:
Computer Science Program, University of Southern California, Los Angeles, California
Venue:
Proceedings of the 1976 conference on Data : Abstraction, definition and structure
Year:
1976

Citing 0
Cited 13

Control and Definition Modularization: an Improved Software Design Technique for Organizing Programs

IEEE Transactions on Software Engineering
Data Type Specification: Parameterization and the Power of Specification Techniques

ACM Transactions on Programming Languages and Systems (TOPLAS)
Some ideas on data types in high-level languages

Communications of the ACM
The role of data abstractions in practical programming

ACM-SE 16 Proceedings of the 16th annual Southeast regional conference
Data type specification: Parameterization and the power of specification techniques

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Complexity of implementations on the level of algebraic specifications

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The design of data type specifications

ICSE '76 Proceedings of the 2nd international conference on Software engineering
Some extensions to algebraic specifications

Proceedings of an ACM conference on Language design for reliable software
On the application of data abstraction facilities

ACM '78 Proceedings of the 1978 annual conference - Volume 2
Some remarks on abstract data types

ACM SIGPLAN Notices
Rapid prototyping by means of abstract module specifications written as trace axioms

Proceedings of the workshop on Rapid prototyping
Algebraic implementation of abstract data types: an announcement

ACM SIGACT News
A history of CLU

History of programming languages---II

Quantified Score

Hi-index	0.02

Visualization

Abstract

Abstract data types can play a significant role in the development of software that is reliable, efficient, and flexible. This paper presents and discusses the application of an algebraic technique for the specification of abstract data types. Among the examples presented is a top-down development of a symbol table for a block structured language, including a discussion of the proof of its correctness. The paper also contains a brief discussion of the problems involved in constructing algebraic specifications that are both consistent and sufficiently-complete.