article

Free access

Selection of representations for data structures

Authors:

Stanley J. Rosenschein,

Shmuel M. KatzAuthors Info & Claims

ACM SIGPLAN Notices, Volume 12, Issue 8

Pages 147 - 154

https://doi.org/10.1145/872734.806944

Published: 01 August 1977 Publication History

PDF eReader

Abstract

The process of selecting representations for data structures is considered. The model of the selection process we suggest is centered around a base of known abstract data structures and their representations. The abstract data structure for which a representation is required would not necessarily be in the base, but should be a combination of base data structures.

After describing this model of selection and its motivation, two aspects of the process are examined in more detail: a) The interaction with the user is treated by defining a language for the natural description of data structure requirements and b) two main types of combinations—hierarchical and cross-product—are analyzed, clarifying the relation between representations for component data structures and a representation for the combination.

References

[1]

Earley, J., High level iterators and a method for automatically designing data structure representation. Computer Languages, Vol. 1, No.4, pp. 321-342, 1975.

Digital Library

Google Scholar

[2]

Katz, S.M. and Rosenschein, S.J., Verifying formal specifications of data structures, IBM-Israel Scientific Center, Research Report, July 1977.

Google Scholar

[3]

Low, J.R., Automatic Coding: Choice of Data Structures, Ph.D. thesis, Stanford University, Computer Science Memo, STAN-CS-74-452, 1974.

Digital Library

Google Scholar

[4]

Liskov, B.K. and Zilles, S.N., Specification techniques for data abstractions. IEEE Transactions on Software Engineering, SE-1, No.1, pp. 7-19, March 1975.

Digital Library

Google Scholar

[5]

Schwartz, J.T., Optimization of very high level languages - I and II, Computer Languages, Vol.1, Nos.2 and 3, pp. 161-194, 197-218, 1975.

Digital Library

Google Scholar

Cited By

View all

ROWE LTONGE F(1986)Automating the Selection of Implementation Structures Manuscript January 6, 1978; revised March 1, 1978.Readings in Artificial Intelligence and Software Engineering10.1016/B978-0-934613-12-5.50024-0(245-257)Online publication date: 1986
https://doi.org/10.1016/B978-0-934613-12-5.50024-0
Kant EBurstall R(1986)On the Efficient Synthesis of Efficient Programs**The research reported here was conducted while the author was at Stanford University. The work was supported by a National Science Foundation Fellowship, by a Fannie and John Hertz Foundation Fellowship, by the Stanford Artificial Intelligence Laboratory under ARPA Order 2494, Contract MDA903-76-C-0206, and by Systems Control, Inc. under ARPA Order 3687, Contract N00014-79-C-0127. The views and conclusions contained in this paper should not be interpreted as necessarily representing the official policies, either expressed or implied, of any funding agency.Readings in Artificial Intelligence and Software Engineering10.1016/B978-0-934613-12-5.50015-X(157-183)Online publication date: 1986
https://doi.org/10.1016/B978-0-934613-12-5.50015-X
Yanxia Jia Yonglei Tao (2010)Developing an abstract model of data structures via model refinement2010 3rd International Conference on Computer Science and Information Technology10.1109/ICCSIT.2010.5563601(290-294)Online publication date: Jul-2010
https://doi.org/10.1109/ICCSIT.2010.5563601
Show More Cited By

Index Terms

Recommendations

Selection of representations for data structures
Proceedings of the 1977 symposium on Artificial intelligence and programming languages

The process of selecting representations for data structures is considered. The model of the selection process we suggest is centered around a base of known abstract data structures and their representations. The abstract data structure for which a ...
Selection of representations for data structures
Proceedings of the 1977 symposium on Artificial intelligence and programming languages

The process of selecting representations for data structures is considered. The model of the selection process we suggest is centered around a base of known abstract data structures and their representations. The abstract data structure for which a ...
Automatic Data Structure Selection and Transformation for Sparse Matrix Computations

The problem of compiler optimization of sparse codes is well known and no satisfactory solutions have been found yet. One of the major obstacles is formed by the fact that sparse programs explicitly deal with particular data structures selected for ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 12, Issue 8

Proceedings of the 1977 symposium on Artificial intelligence and programming languages

August 1977

179 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/872734

Issue’s Table of Contents

Proceedings of the 1977 symposium on Artificial intelligence and programming languages
August 1977
185 pages
ISBN:9781450378741
DOI:10.1145/800228
Chairman:
James Low

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1977

Published in SIGPLAN Volume 12, Issue 8

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
448
Total Downloads

Downloads (Last 12 months)100
Downloads (Last 6 weeks)19

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

ROWE LTONGE F(1986)Automating the Selection of Implementation Structures Manuscript January 6, 1978; revised March 1, 1978.Readings in Artificial Intelligence and Software Engineering10.1016/B978-0-934613-12-5.50024-0(245-257)Online publication date: 1986
https://doi.org/10.1016/B978-0-934613-12-5.50024-0
Kant EBurstall R(1986)On the Efficient Synthesis of Efficient Programs**The research reported here was conducted while the author was at Stanford University. The work was supported by a National Science Foundation Fellowship, by a Fannie and John Hertz Foundation Fellowship, by the Stanford Artificial Intelligence Laboratory under ARPA Order 2494, Contract MDA903-76-C-0206, and by Systems Control, Inc. under ARPA Order 3687, Contract N00014-79-C-0127. The views and conclusions contained in this paper should not be interpreted as necessarily representing the official policies, either expressed or implied, of any funding agency.Readings in Artificial Intelligence and Software Engineering10.1016/B978-0-934613-12-5.50015-X(157-183)Online publication date: 1986
https://doi.org/10.1016/B978-0-934613-12-5.50015-X
Yanxia Jia Yonglei Tao (2010)Developing an abstract model of data structures via model refinement2010 3rd International Conference on Computer Science and Information Technology10.1109/ICCSIT.2010.5563601(290-294)Online publication date: Jul-2010
https://doi.org/10.1109/ICCSIT.2010.5563601
(1986)BIBLIOGRAPHYReadings in Artificial Intelligence and Software Engineering10.1016/B978-0-934613-12-5.50050-1(589-599)Online publication date: 1986
https://doi.org/10.1016/B978-0-934613-12-5.50050-1
Kant EBarstow D(1981)The Refinement ParadigmIEEE Transactions on Software Engineering10.1109/TSE.1981.2308547:5(458-471)Online publication date: 1-Sep-1981
https://dl.acm.org/doi/10.1109/TSE.1981.230854

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations