(Enter summary)
Abstract: : Copy avoidance refers to the safe replacement, at compile time, of
copying operations by destructive updates in single-assignment languages. Conceptually,
the problem can be divided into two components: identifying memory
cells that can safely be reused at a program point via destructive updating; and
deciding how to actually reuse such cells. Most of the work on this problem, to
date, has focused on the first component, typically via dataflow analyses to detect
when memory cells become dead... (Update)
Context of citations to this paper: More
.... have considered this problem 2 Nancy Mazur et al. within single assignment languages, in the context of logic programming languages [6,11,13], as well as functional programming languages [2,9,17,18] Some of the approaches involve special language constructs (such as uniqueness...
.... been a lot of research on methods to overcome this handicap and improve the memory management, both for logic programming languages [5, 12, 14], as for functional programming languages [10, 19] Some approaches depend on a combination of special language constructs and...
Cited by: More
Storage Size Reduction by In-place Mapping of Arrays - Tronçon.. (2002)
(Correct)
Practical Aspects for a Working Compile Time Garbage .. - Mazur, Ross.. (2001)
(Correct)
Practical Aspects for a working Compile Time Garbage .. - Mazur, Ross.. (2001)
(Correct)
Active bibliography (related documents): More All
0.8: A Practical Approach to Structure Reuse of Arrays in Single.. - Andreas Kagedal (1997)
(Correct)
0.5: the Garbage Collection Bibliography - Richard Jones (2003)
(Correct)
0.5: Detection And Optimization Of Suspension-Free Logic Programs - Debray, Gudeman, Bigot (1996)
(Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.1: Compiler Techniques for Code Compaction - Debray, Evans, Muth, De Sutter (2000)
(Correct)
0.1: Efficient Dataflow Analysis of Logic Programs - Debray (1992)
(Correct)
0.1: A Methodology for Granularity Based Control of.. - Lopez, Hermenegildo.. (1996)
(Correct)
Related documents from co-citation: More All
7: Compile-time garbage collection for ground Prolog (context) - Klu'zniak - 1988
5: The essence of functional programming
- Wadler - 1992
5: Update in place: Overview of the Siva project (context) - Gudjonsson, Winsborough - 1993
BibTeX entry: (Update)
S. K. Debray. On copy avoidance in single assignment languages. In D. S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming, pages 393--407, Budapest, Hungary, 1993. The MIT Press. http://citeseer.ist.psu.edu/debray93copy.html More
@inproceedings{ debray93copy,
author = "Saumya K. Debray",
title = "On Copy Avoidance in Single Assignment Languages",
booktitle = "International Conference on Logic Programming",
pages = "393-407",
year = "1993",
url = "citeseer.ist.psu.edu/debray93copy.html" }
Citations (may not include all citations):
4212
Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
258
Data Structures and Network Algorithms (context) - Tarjan - 1983
127
The Complexity of Satisfiability Problems (context) - Schaefer - 1978
72
A Semantic Model for Reference Counting and its Abstraction
- Hudak - 1987
56
Janus: A step towards distributed constraint programming (context) - Saraswat, Kahn et al. - 1990
53
Compile-time Garbage Collection by Sharing Analysis (context) - Jones, Le Metayer - 1989
29
Practical Aspects of Set Based Analysis
- Heintze - 1992
21
Analysis of Shared Data Structures for Compile-Time Garbage .. (context) - Mulkers, Winsborough et al. - 1990
17
Order-of-Evaluation Analysis for Destructive Updates in Stri..
- Sastry, Clinger - 1992
15
Path Analysis and Optimization of Non-strict Functional Lang.. (context) - Bloss - 1989
11
Compile-time Garbage Collection for Ground Prolog (context) - Klu'zniak - 1987
10
Copy Avoidance through Compile-Time Analysis and Local Reuse (context) - Foster, Winsborough - 1991
5
Compile-Time Garbage Collection (context) - Bruynooghe - 1986
4
A Compile-Time Memory Reuse Scheme for Concurrent Logic Prog.. (context) - Sundararajan, Sastry et al. - 1992
2
Compile-Time Garbage Collection for Prolog (context) - Bruynooghe, Mulkers et al. - 1988
2
personal communication (context) - Winsborough - 1992
1
jc: An Efficient and Portable Sequential Implementation of J.. (context) - Gudeman, De Bosschere et al. - 1992
1
The Aggregate Update Problem in Functional Languages (context) - Hudak, Bloss - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.arizona.edu/people/debray/papers/index.html): More
Reasoning About Naming Systems - Bowman, Debray, Peterson (1993)
(Correct)
A Simple Program Transformation for Parallelism - Debray, Jain (1994)
(Correct)
Towards Banishing the Cut from Prolog - Debray, Warren (1990)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC