Structured Data Structures.
Saved in:
| Title: | Structured Data Structures. |
|---|---|
| Authors: | Shneiderman, Ben1, Scheuermann, Peter2, Morgan, H. |
| Source: | Communications of the ACM. Oct74, Vol. 17 Issue 10, p566-574. 9p. 6 Diagrams. |
| Subjects: | Database management, Data structures, Electronic data processing, Structured programming, Computer programming, Computer software |
| 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. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 5225239 AccessLevel: 6 PubType: Periodical PubTypeId: serialPeriodical PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Structured Data Structures. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Shneiderman%2C+Ben%22">Shneiderman, Ben</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Scheuermann%2C+Peter%22">Scheuermann, Peter</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Morgan%2C+H%2E%22">Morgan, H.</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Oct74, Vol. 17 Issue 10, p566-574. 9p. 6 Diagrams. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Database+management%22">Database management</searchLink><br /><searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+data+processing%22">Electronic data processing</searchLink><br /><searchLink fieldCode="DE" term="%22Structured+programming%22">Structured programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software%22">Computer software</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: 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. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5225239 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1145/355620.361170 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 9 StartPage: 566 Subjects: – SubjectFull: Database management Type: general – SubjectFull: Data structures Type: general – SubjectFull: Electronic data processing Type: general – SubjectFull: Structured programming Type: general – SubjectFull: Computer programming Type: general – SubjectFull: Computer software Type: general Titles: – TitleFull: Structured Data Structures. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Shneiderman, Ben – PersonEntity: Name: NameFull: Scheuermann, Peter – PersonEntity: Name: NameFull: Morgan, H. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: Oct74 Type: published Y: 1974 Identifiers: – Type: issn-print Value: 00010782 Numbering: – Type: volume Value: 17 – Type: issue Value: 10 Titles: – TitleFull: Communications of the ACM Type: main |
| ResultId | 1 |
