Reference escape analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Reference escape analysis: optimizing reference counting based on the lifetime of references

Full text

Pdf (1.06 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

New Haven, Connecticut, United States

Pages: 178 - 189

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Authors

Young Gil Park	Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY
Benjamin Goldberg	Department of Computer Science, Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 14, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/115865.115883 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.

	Abr86	Samson Abramsky, Strictness analysis and polymorphic invariance, on Programs as data objects, p.1-23, April 1986, Copenhagen, Denmark
	AH87	S. Abramsky , C. Hankin, Abstract interpretation of declarative languages, Halsted Press, New York, NY, 1987
	Bar77	Jeffrey M. Barth, Shifting garbage collection overhead to compile time, Communications of the ACM, v.20 n.7, p.513-518, July 1977 [doi>10.1145/359636.359713]
	Bev87	D I Bevan, Distributed garbage collection using reference counting, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.176-187, March 1987, Eindhoven, The Netherlands
	BHA86	G. L. Burn , C. L. Hankin , S. Abramsky, The theory of strictness analysis for higher order functions, on Programs as data objects, p.42-62, April 1986, Copenhagen, Denmark
	Blo89	A. Bloss. Path Analysis: Using Order-of- Evaluation Information to Optimize Lazy Functional Languages. Ph.D. Thesis, Yale University, 1989.
	Deu90	Alan Deutsch, On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.157-168, December 1989, San Francisco, California, United States [doi>10.1145/96709.96725]
	DB76	L. Peter Deutsch , Daniel G. Bobrow, An efficient, incremental, automatic garbage collector, Communications of the ACM, v.19 n.9, p.522-526, Sept. 1976 [doi>10.1145/360336.360345]
	Gol89	B. Goldberg, Generational reference counting: a reduced-communication distributed storage reclamation scheme, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.313-321, June 19-23, 1989, Portland, Oregon, United States
	GP90	B. Goldberg , Y. G. Park, Higher order escape analysis: optimizing stack allocation in functional program implementations, Proceedings of the third European symposium on programming on ESOP '90, p.152-160, May 1990, Copenhagen, Denmark
	Hud86	Paul Hudak, A semantic model of reference counting and its abstraction (detailed summary), Proceedings of the 1986 ACM conference on LISP and functional programming, p.351-363, August 1986, Cambridge, Massachusetts, United States [doi>10.1145/319838.319876]
	HY86	Paul Hudak , Jonathan Young, Higher-order strictness analysis in untyped lambda calculus, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.97-109, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512653]
	JL89	Simon B. Jones , Daniel Le Métayer, Compile-time garbage collection by sharing analysis, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.54-74, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99375]
	Myc81	A. Mycroft. Abstract Interpretation and Optimizing Transformations }or Applicative Programs. PhD thesis, University of Edinburgh, 1981.
	Par91	Young-Gil Park, Semantic analyses for storage management optimizations in functional language implementations, New York University, New York, NY, 1992
	Wad87	P. Wadler. Strictness analysis on non-flat domains. In Abstract Interpretation of Declarative Languages. C.L. Hankin and S. Abramsky, editors. Ellis Horwood, 1987.
	WW87	P Watson , I Watson, An efficient garbage collection scheme for parallel computer architectures, Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe, p.432-443, March 1987, Eindhoven, The Netherlands

CITED BY 6

	Marc Neuberger , Prateek Mishra, A precise relationship between the deductive power of forward and backward strictness analysis, ACM SIGPLAN Lisp Pointers, v.V n.1, p.127-138, Jan. 1992
	Young Gil Park , Benjamin Goldberg, Escape analysis on lists, ACM SIGPLAN Notices, v.27 n.7, p.116-127, July 1992
	Pramod G. Joisha, Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast, Proceedings of the 6th international symposium on Memory management, October 21-22, 2007, Montreal, Quebec, Canada
	Pramod G. Joisha, Compiler optimizations for nondeferred reference: counting garbage collection, Proceedings of the 2006 international symposium on Memory management, June 10-11, 2006, Ottawa, Ontario, Canada
	Pramod G. Joisha, A principled approach to nondeferred reference-counting garbage collection, Proceedings of the fourth ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, March 05-07, 2008, Seattle, WA, USA
	Henry G. Baker, Minimizing reference count updating with deferred and anchored pointers for functional data structures, ACM SIGPLAN Notices, v.29 n.9, p.38-43, Sept. 1994