Article

Free access

Compile-time garbage collection by sharing analysis

Authors:

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

Pages 54 - 74

https://doi.org/10.1145/99370.99375

Published: 01 November 1989 Publication History

PDF eReader

References

[1]

Abramsky S, Hankin C, "Abstract interpretation of declarative languages", Ellis Horwood, 1987.

Digital Library

Google Scholar

[2]

Barth J. M., "Shifting garbage collection overhead to compile time", CACM 20(7), July 1977.

Digital Library

Google Scholar

[3]

Burstall R M, Darlington I, "A transformation system for developing recursive programs", JACM 24(1)~ January 1977.

Digital Library

Google Scholar

[4]

Hudak P, "A semantic model of reference counting and its abstraction", in {Abramsky87}.

Google Scholar

[5]

Hughes J, "Backwards analysis of functional programs", University of Glasgow, Dept of Computing Science, ~h report CSC/87~3, March 1987.

Google Scholar

[6]

Inoue K., Seki H., Yagi H., "Analysis of functional programs to detect run-time garbage cells", ACM TOPLAS 10(4), October 1988.

Digital Library

Google Scholar

[7]

Jones S B, Le M6tayer D, "A new method for stricmess analysis on non-flat domains", INRIA research ~pon (to appear).

Google Scholar

[8]

Meira S L, "Optimized combinatoric code for applicative language implementation", Proceedings of 6th International Symposium on Programming, 1984, LNCS 167.

Digital Library

Google Scholar

[9]

Schwarz J, "Verifying the safe use of destructive operations in applicative programs", Proceedings of 3rd International Symposium on Programming, 1978, Dunod informatique.

Google Scholar

[10]

Stoye W R, Clarke T J W, Norman A C, "Some practical methods for rapid eombinator reduction", Proceedings of ACM Symposium on Lisp and Functional Programming, Austin, Texas, 1984.

Digital Library

Google Scholar

[11]

Wadler P L, Hughes R J M, "Projections for strictness analysis", 3rd Int Conference on Functional Programming and Computer Architecture, Portland, Oregon, September 1987.

Digital Library

Google Scholar

[12]

Wadler P L, "Deforestation: Transforming programs to eliminate trees", European Symposium on Programming, France, March 1988.

Digital Library

Google Scholar

Cited By

View all

Bansal AGoel SShah PSanyal AKumar PDing CMaas M(2020)Garbage collection using a finite liveness domainProceedings of the 2020 ACM SIGPLAN International Symposium on Memory Management10.1145/3381898.3397208(1-15)Online publication date: 16-Jun-2020
https://dl.acm.org/doi/10.1145/3381898.3397208
Kumar K. PSanyal AKarkare A(2016)Liveness-based garbage collection for lazy languagesACM SIGPLAN Notices10.1145/3241624.292669851:11(122-133)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/3241624.2926698
Kumar K. PSanyal AKarkare AFlood CZhang Z(2016)Liveness-based garbage collection for lazy languagesProceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management10.1145/2926697.2926698(122-133)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/2926697.2926698
Show More Cited By

Index Terms

Compile-time garbage collection by sharing analysis
1. Software and its engineering
  1. Software notations and tools
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

Age-based garbage collection

Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...
Age-based garbage collection
OOPSLA '99: Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications

Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...
Garbage collection hints
HiPEAC'05: Proceedings of the First international conference on High Performance Embedded Architectures and Compilers

This paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms of when and how to collect. We argue that garbage collection should be done when the amount of live bytes is low (in order to minimize the collection cost)...

Comments

Information & Contributors

Information

Published In

FPCA '89: Proceedings of the fourth international conference on Functional programming languages and computer architecture

November 1989

395 pages

ISBN:0897913280

DOI:10.1145/99370

Chairman:
Joseph E. Stoy

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

FPCA89

Sponsor:

SIGPLAN
IFIP WG 2.8
SIGARCH

FPCA89: The International Conference on Functional Programming Languages & Computer Architectures

September 11 - 13, 1989

Imperial College, London, United Kingdom

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

50
Total Citations
View Citations
514
Total Downloads

Downloads (Last 12 months)61
Downloads (Last 6 weeks)15

Reflects downloads up to 27 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bansal AGoel SShah PSanyal AKumar PDing CMaas M(2020)Garbage collection using a finite liveness domainProceedings of the 2020 ACM SIGPLAN International Symposium on Memory Management10.1145/3381898.3397208(1-15)Online publication date: 16-Jun-2020
https://dl.acm.org/doi/10.1145/3381898.3397208
Kumar K. PSanyal AKarkare A(2016)Liveness-based garbage collection for lazy languagesACM SIGPLAN Notices10.1145/3241624.292669851:11(122-133)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/3241624.2926698
Kumar K. PSanyal AKarkare AFlood CZhang Z(2016)Liveness-based garbage collection for lazy languagesProceedings of the 2016 ACM SIGPLAN International Symposium on Memory Management10.1145/2926697.2926698(122-133)Online publication date: 14-Jun-2016
https://dl.acm.org/doi/10.1145/2926697.2926698
Asati RSanyal AKarkare AMycroft A(2014)Liveness-Based Garbage CollectionCompiler Construction10.1007/978-3-642-54807-9_5(85-106)Online publication date: 2014
https://doi.org/10.1007/978-3-642-54807-9_5
Hage JHoldermans SHatcliff JGlück Rde Moor O(2008)Heap recycling for lazy languagesProceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation10.1145/1328408.1328436(189-197)Online publication date: 7-Jan-2008
https://dl.acm.org/doi/10.1145/1328408.1328436
Alpuente MEscobar SLucas S(2007)Removing redundant arguments automaticallyTheory and Practice of Logic Programming10.1017/S14710684060028697:1-2(3-35)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1017/S1471068406002869
O'Neill MBurton FHosking AAdl-Tabatabai A(2006)Smarter garbage collection with simplifiersProceedings of the 2006 workshop on Memory system performance and correctness10.1145/1178597.1178601(19-30)Online publication date: 22-Oct-2006
https://dl.acm.org/doi/10.1145/1178597.1178601
Guyer SMcKinley KFrampton DSchwartzbach MBall T(2006)Free-MeProceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1133981.1134024(364-375)Online publication date: 11-Jun-2006
https://dl.acm.org/doi/10.1145/1133981.1134024
Guyer SMcKinley KFrampton D(2006)Free-MeACM SIGPLAN Notices10.1145/1133255.113402441:6(364-375)Online publication date: 11-Jun-2006
https://dl.acm.org/doi/10.1145/1133255.1134024
Mohneu M(2005)Efficient compile-time garbage collection for arbitrary data structuresProgramming Languages: Implementations, Logics and Programs10.1007/BFb0026824(241-258)Online publication date: 16-Jun-2005
https://doi.org/10.1007/BFb0026824
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Age-based garbage collection

Age-based garbage collection

Garbage collection hints

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Age-based garbage collection

Age-based garbage collection

Garbage collection hints

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations