An Automatic Technique for Selection of Data Representations in SETL Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)

Volumn 3, Issue 2, 1981, Pages 126-143

  Schonberg, Edmond ^a   Schwartz, Jacob T ^a   Sharir, Micha ^b  

^a NEW YORK UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976758332     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/357133.357135     Document Type: Article

References (25)

1. Aho, A.V., And Ullman, J.D. Principles of Compiler Design. Addison-Wesley, Reading, Mass.,1977.
2. Allen, F.E. Control flow analysis. In Proc. Symp. Compiler Optimization, SIGPLAN Notices 5 (1970), 1-19.
3. Balzer, R.M. Dataless programming. In Proc. 1967 AFIPS Fall Joint Computer Conf., Thompson Books, Washington, D.C., pp. 535-544.
4. Dewar, R.B.K. The SETL programming language. To appear.
5. Dewar, R.B.K., Grand, A., Liu, S.-C., Schwartz, J.T., And Schonberg, E. Programming by refinement, as exemplified by the SETL representation sublanguage. ACM Trans. Program. Lang. Syst. 1, 1 (July 1979), 27-49.
6. D'Imperio, M.E. Data structures and their representation in storage. Annu. Rev. Autom. Program. 5 (1969), 1-76.
7. Earley, J. Toward an understanding of data structures. Commun. ACM 14, 10 (Oct. 1971), 617-627.
8. Halstead, M.H. Elements of Software Science. Elsevier North-Holland, New York, 1977.
9. Hecht, M.S. Flow Analysis of Computer Programs. Elsevier North-Holland, New York, 1977.
10. Lie, S.C. Data-Structure Choice. Ph.D. Dissertation, Courant Computer Science Rep. No. 15, Courant Inst. Mathematical Sciences, New York, 1979.
11. Low, J.R. Automatic data structure selection: An example and overview. Commun. ACM 21, 5 (May 1978), 376-385.
12. Mealy, G.H. Another look at data. In Proc. 1967 AFIPS Fall Joint Computer Conf., Thompson Books, Washington, D.C., pp. 525-534
13. Reif, J.H. Combinatorial Aspects of Symbolic Program Analysis. Ph.D. Dissertation, Harvard Univ., Cambridge, Mass., 1977.
14. Schonberc, E., And Liu, S.C. Manual and automatic data-structuring in SETL. In Proc. 5th Ann. Informal Implementors Interchange Conf., Guidel, France, 1977, pp. 284-304.
15. Schwartz, J.T. Automatic data structure choice in a language of very high level. In Conf. Rec.,2d ACM Syrup. on Principles of Programming Languages, Palo Alto, Calif., Jan. 20,22, 1975, pp. 36-40.
16. Schwartz, J.T. Automatic data structure choice in a language of very high level. In Conf. Rec.,2d ACM Syrup. on Principles of Programming Languages, Palo Alto, Calif., Jan. 20-22, 1975, pp. 36-40.
17. Schwartz, J.T. On programming: An interim report on the Setl project, 2d ed. Courant Inst. Mathematical Sciences, New York, 1975
18. Schwartz, J.T. Use-use chaining as a technique in typefinding. Setl Newsl. 140, Courant Inst. Mathematical Sciences, New York, 1974
19. Schwartz, J.T., And Sharir, M. A design for optimizations of the bitvectoring class. Courant Computer Science Rep. No. 17, Courant Inst. Mathematical Sciences, New York, 1979
20. Schwartz, J.T., And Sharir, M. Experience with automatic data structure selection in the Setl system. Presented at 2d Program Transformation Workshop, Harvard Univ., Cambridge, Mass., Sept. 1979.
21. Senko, M., Altman, E., Astrahan, M., And Fehder, P. Data structures and accessing in database systems. IBM Syst. J. 12 (1973), 30-93.
22. Tarjan, R.E. Fast algorithms for solving path problems. J. ACM 28, 3 (July 1981), to appear
23. Tarjan, R.E. A unified approach to path problems. J. ACM 28, 3 (July 1981), to appear.
24. Tarjan, R.E. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2 (April 1975),215-225.
25. Tenenbaum, A.M. Type determination for very high level languages. Courant Computer Science Rep. No. 3, Courant Inst. Mathematical Sciences, New York, 1974.