An Automatic Technique for Selection of Data Representations in SETL Programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

An Automatic Technique for Selection of Data Representations in SETL Programs

Full text

Pdf (1.22 MB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 3 , Issue 2 (April 1981) table of contents

Pages: 126 - 143

Year of Publication: 1981

ISSN:0164-0925

Authors

Edmond Schonberg	Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY
Jacob T. Schwartz	Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY
Micha Sharir	Department of Mathematics, Tel Aviv University, Tel Aviv, Israel

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 48, Citation Count: 25

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/357133.357135 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alfred V. Aho , Jeffrey D. Ullman, Principles of Compiler Design (Addison-Wesley series in computer science and information processing), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1977
	2	Frances E. Allen, Control flow analysis, Proceedings of a symposium on Compiler optimization, p.1-19, July 27-28, 1970, Urbana-Champaign, Illinois
	3	BALZER, R.M. Dataless programming. In Proc. 1967AFIPS Fall Joint Computer Conf., Thompson Books, Washington, D.C., pp. 535-544.
	4	DEWAR, R.B.K. The SETL programming language. To appear.
	5	Robert K. Dewar , Arthur and Ssu-Cheng Liu and Jacob T. Schwartz and Edmond Schonberg, Programming by Refinement, as Exemplified by the SETL Representation Sublanguage, ACM Transactions on Programming Languages and Systems (TOPLAS), v.1 n.1, p.27-49, July 1979 [doi>10.1145/357062.357064]
	6	D'IMPERIO, M.E. Data structures and their representation in storage. Annu. Rev. Autom. Program. 5 (1969), 1-76.
	7	Jay Earley, Toward an understanding of data structures, Communications of the ACM, v.14 n.10, p.617-627, Oct. 1971 [doi>10.1145/362759.362764]
	8	Maurice H. Halstead, Elements of Software Science (Operating and programming systems series), Elsevier Science Inc., New York, NY, 1977
	9	Matthew S. Hecht, Flow Analysis of Computer Programs, Elsevier Science Inc., New York, NY, 1977
	10	LIu, S.C. Data-Structure Choice. Ph.D. Dissertation, Courant Computer Science Rep. No. 15, Courant Inst. Mathematical Sciences, New York, 1979.
	11	James R. Low, Automatic data structure selection: an example and overview, Communications of the ACM, v.21 n.5, p.376-385, May 1978 [doi>10.1145/359488.359498]
	12	MEALY, G.H. Another look at data. In Proc. 1967AFIPS 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., ANO 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	Edmond Schonberg , Jacob T. Schwartz , Micha Sharir, Automatic data structure selection in SETL, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.197-210, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567771]
	16	J. T. Schwartz, Automatic data structure choice in a language of very high level, Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.36-40, January 20-22, 1975, Palo Alto, California [doi>10.1145/512976.512981]
	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., ANO 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 FEHOER, P. Data structures and accessing in data base systems. IBM Syst. J. 12 (1973), 30-93.
	22	Robert Endre Tarjan, Fast Algorithms for Solving Path Problems, Journal of the ACM (JACM), v.28 n.3, p.594-614, July 1981 [doi>10.1145/322261.322273]
	23	Robert Endre Tarjan, A Unified Approach to Path Problems, Journal of the ACM (JACM), v.28 n.3, p.577-593, July 1981 [doi>10.1145/322261.322272]
	24	Robert Endre Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM (JACM), v.22 n.2, p.215-225, April 1975 [doi>10.1145/321879.321884]
	25	TENENBAUM, A.M. Type determination for very high level languages. Courant Computer Science Rep. No. 3, Courant Inst. Mathematical Sciences, New York, 1974.

CITED BY 25

	Robert Paige , Shaye Koenig, Finite Differencing of Computable Expressions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.402-454, July 1982
	Stefan M. Freudenberger , Jacob T. Schwartz , Micha Sharir, Experience with the SETL Optimizer, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.1, p.26-45, Jan. 1983
	H. Partsch , R. Steinbrüggen, Program Transformation Systems, ACM Computing Surveys (CSUR), v.15 n.3, p.199-236, Sept. 1983
	E. E. Setliff , R. A. Rutenbar, ELF: a tool for automatic synthesis of custom physical CAD software, Proceedings of the 26th ACM/IEEE conference on Design automation, p.543-548, June 25-28, 1989, Las Vegas, Nevada, United States
	Fritz Henglein, Global tagging optimization by type inference, ACM SIGPLAN Lisp Pointers, v.V n.1, p.205-215, Jan. 1992
	Boumediene Belkhouche , Joseph E. Urban , Gregory A. Riccardi, Synthesizing abstract data type specifications, Proceedings of the 20th annual Southeast regional conference, p.176-181, April 01-03, 1982, Knoxville, Tennessee
	Tyng-Ruey Chuang , Wen L. Hwang, A probabilistic approach to the problem of automatic selection of data representations, ACM SIGPLAN Notices, v.31 n.6, p.190-200, June 15, 1996
	Rajive Bagrodia , Sharad Mathur, Efficient Implementation of high-level parallel programs, ACM SIGARCH Computer Architecture News, v.19 n.2, p.142-151, Apr. 1991
	Jiazhen Cai , Robert Paige, Towards increased productivity of algorithm implementation, ACM SIGSOFT Software Engineering Notes, v.18 n.5, p.71-78, Dec. 1993
	Clark Wiedmann, Efficiency in the APL environment—a full arsenal for attacking CPU hogs, ACM SIGAPL APL Quote Quad, v.15 n.4, p.77-85, May 12, 1985
	Saumya Debray, Abstract interpretation and low-level code optimization, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.111-121, June 21-23, 1995, La Jolla, California, United States
	J. Cai , R. Paige, Binding performance at language design time, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.85-97, January 21-23, 1987, Munich, West Germany
	Dorothy E. Setliff , Rob A. Rutenbar, Knowledge Representation and Reasoning in a Software Synthesis Architecture, IEEE Transactions on Software Engineering, v.18 n.6, p.523-533, June 1992
	Dave Cattrall , Colin Runciman, Widening the representation bottleneck: a functional implementation of relational programming, Proceedings of the conference on Functional programming languages and computer architecture, p.191-200, June 09-11, 1993, Copenhagen, Denmark
	G. E. Weddell, Selection of Indexes to Memory-Resident Entities for Semantic Data, IEEE Transactions on Knowledge and Data Engineering, v.1 n.2, p.274-284, June 1989
	Yanhong A. Liu , Tom Rothamel , Fuxiang Yu , Scott D. Stoller , Nanjun Hu, Parametric regular path queries, ACM SIGPLAN Notices, v.39 n.6, May 2004
	D. R. Smith, KIDS: A Semiautomatic Program Development System, IEEE Transactions on Software Engineering, v.16 n.9, p.1024-1043, September 1990
	Martin S. Feather, Mappings for rapid prototyping, ACM SIGSOFT Software Engineering Notes, v.7 n.5, p.17-24, December 1982
	Gordon S. Novak, Jr., Software Reuse by Specialization of Generic Procedures through Views, IEEE Transactions on Software Engineering, v.23 n.7, p.401-417, July 1997
	Don Batory , Gang Chen , Eric Robertson , Tao Wang, Design Wizards and Visual Programming Environments for GenVoca Generators, IEEE Transactions on Software Engineering, v.26 n.5, p.441-452, May 2000
	Deepak Goyal, Transformational Derivation of an Improved Alias Analysis Algorithm, Higher-Order and Symbolic Computation, v.18 n.1-2, p.15-49, June 2005
	David A. Sykes, Culturing objects to achieve efficient implementations and entity interactions in object-oriented programming, Proceedings of the 33rd annual on Southeast regional conference, March 17-18, 1995, Clemson, South Carolina
	Yanhong A. Liu , Scott D. Stoller , Michael Gorbovitski , Tom Rothamel , Yanni Ellen Liu, Incrementalization across object abstraction, ACM SIGPLAN Notices, v.40 n.10, October 2005
	Tom Rothamel , Yanhong A. Liu, Efficient implementation of tuple pattern based retrieval, Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, January 15-16, 2007, Nice, France
	Shmuel Katz , Ruth Zimmerman, An advisory system for developing data representations, Proceedings of the 7th international joint conference on Artificial intelligence, p.1030-1036, August 24-28, 1981, Vancouver, BC, Canada