Structured data structures

Authors:
Ben Shneiderman;Peter Scheuermann
Affiliations:
Indiana Univ., Bloomington;State Univ. of New York at Stony Brook, Stony Brook
Venue:
Communications of the ACM
Year:
1974

Citing 6
Cited 6

A language for treating graphs

Communications of the ACM
Program development by stepwise refinement

Communications of the ACM
A language extension for graph processing and its formal semantics

Communications of the ACM
Toward an understanding of data structures

Communications of the ACM
Letters to the editor: go to statement considered harmful

Communications of the ACM
Data structures: description, manipulation and evaluation

Data structures: description, manipulation and evaluation

A facility for defining and manipulating generalized data structures

ACM Transactions on Database Systems (TODS)
Formalization of operations and function definitions in a functional programming language for data structures

CSC '87 Proceedings of the 15th annual conference on Computer Science
Remark on uniform insertion in structured data structures

Communications of the ACM
Structured data interfacing for software systems

ACM '77 Proceedings of the 1977 annual conference
Data base systems

IBM Systems Journal
Recent developments in the theory of data structures

Computer Languages

Quantified Score

Hi-index	48.25

Visualization

Abstract

Programming systems which permit arbitrary linked list structures enable the user to create complicated structures without sufficient protection. Deletions can result in unreachable data elements, and there is no guarantee that additions will be performed properly. To remedy this situation, this paper proposes a Data Structure Description and Manipulation Language which provides for the creation of a restricted class of data structures but ensures the correctness of the program. This is accomplished by an explicit structure declaration facility, a restriction on the permissible operations, and execution-time checks.