Issue No. 06 - November (1978 vol. 4)
L.A. Rowe , Computer Science Division, Department of Electrical Engineering and Computer Sciences, University of California
An approach to automating the selection of implementations for the data representations used in a program is presented. Formalisms are developed for specifying data representations and implementation structures. Using these formalisms, algorithms are presented which will recognize the use in a program of known data representations (e. g., stacks, queues, lists, arrays, etc.) so that alternative implementations can be retrieved from a library and which will, for those representations not recognized, generate alternative implementations with a wide range of space-time tradeoffs. Experience with using these algorithms indicates they are reasonably successful, although there are several problems that must be solved before automatic implementation selection systems will be practical.
modeling-structure recognition, Data representations, data structures, implementation structure selection, modeling structures
L.A. Rowe, F.M. Tonge, "Automating the Selection of Implementation Structures", IEEE Transactions on Software Engineering, vol. 4, no. , pp. 494-506, November 1978, doi:10.1109/TSE.1978.233873