This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Automating the Selection of Implementation Structures
November 1978 (vol. 4 no. 6)
pp. 494-506
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.
Index Terms:
modeling-structure recognition, Data representations, data structures, implementation structure selection, modeling structures
Citation:
L.A. Rowe, F.M. Tonge, "Automating the Selection of Implementation Structures," IEEE Transactions on Software Engineering, vol. 4, no. 6, pp. 494-506, Nov. 1978, doi:10.1109/TSE.1978.233873
Usage of this product signifies your acceptance of the Terms of Use.