Stanley J. Rosenschein
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.
- 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.Google Scholar
Digital Library
- 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. Google ScholarDigital Library
- 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.Google ScholarDigital Library
- 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.Google ScholarDigital Library
Index Terms
- Selection of representations for data structures
Recommendations
Selection of representations for data structures
Proceedings of the 1977 symposium on Artificial intelligence and programming languagesThe 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 languagesThe 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