A Fortran-Compiled List-Processing Language
Journal of the ACM (JACM)
Recursive functions of symbolic expressions and their computation by machine, Part I
Communications of the ACM
An architecture for efficient Lisp list access
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Incremental incrementally compacting garbage collection
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
Tenuring policies for generation-based storage reclamation
OOPSLA '88 Conference proceedings on Object-oriented programming systems, languages and applications
An adaptive tenuring policy for generation scavengers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
The derivation of distributed termination detection algorithms from garbage collection schemes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Guardians in a generation-based garbage collector
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Thermodynamics and garbage collection
ACM SIGPLAN Notices
The Boyer benchmark meets linear logic
ACM SIGPLAN Lisp Pointers
Linear logic and permutation stacks—the Forth shall be first
ACM SIGARCH Computer Architecture News - Special issue: panel sessions of the 1991 workshop on multithreaded computers
Sparse polynomials and linear logic
ACM SIGSAM Bulletin
A bibliography on garbage collection and related topics
ACM SIGPLAN Notices
Static and dynamic partitioning of pointers as links and threads
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Indirect distributed garbage collection: handling object migration
ACM Transactions on Programming Languages and Systems (TOPLAS)
Research Demonstration of a Hardware Reference-Counting Heap
Lisp and Symbolic Computation
Ephemerons: a new finalization mechanism
Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
One-bit counts between unique and sticky
Proceedings of the 1st international symposium on Memory management
Hierarchical distributed reference counting
Proceedings of the 1st international symposium on Memory management
A distributed garbage collector with diffusion tree reorganisation and mobile objects
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Garbage collecting the Internet: a survey of distributed garbage collection
ACM Computing Surveys (CSUR)
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
List processing in real time on a serial computer
Communications of the ACM
Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures
Communications of the ACM
PM, a system for polynomial manipulation
Communications of the ACM
Communications of the ACM
Letters to the editor: on word combinations
Communications of the ACM
Letters to the editor: on the reference counter method
Communications of the ACM
Experience with memory management in open Linda systems
Proceedings of the 2001 ACM symposium on Applied computing
Java without the coffee breaks: a nonintrusive multiprocessor garbage collector
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
An on-the-fly reference counting garbage collector for Java
OOPSLA '01 Proceedings of the 16th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Error-free garbage collection traces: how to cheat and not get caught
SIGMETRICS '02 Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A parts breakdown technique using list structures
Communications of the ACM
In or out?: putting write barriers in their place
Proceedings of the 3rd international symposium on Memory management
Tree Rerooting in Distributed Garbage Collection: Implementation and Performance Evaluation
Higher-Order and Symbolic Computation
An efficient algorithm for cyclic reference counting
Information Processing Letters
Concurrent Cycle Collection in Reference Counted Systems
ECOOP '01 Proceedings of the 15th European Conference on Object-Oriented Programming
Decreasing Memory Overhead in Hard Real-Time Garbage Collection
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Direct execution of lisp on a list_directed architecture
ASPLOS I Proceedings of the first international symposium on Architectural support for programming languages and operating systems
EDUSAC - an educational list processing system
SIGCSE '76 Proceedings of the sixth SIGCSE technical symposium on Computer science education
The SAC-1 system: An introduction and survey
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Generation Scavenging: A non-disruptive high performance storage reclamation algorithm
SDE 1 Proceedings of the first ACM SIGSOFT/SIGPLAN software engineering symposium on Practical software development environments
ACM SIGPLAN Notices - Special issue: History of programming languages conference
ACM '61 Proceedings of the 1961 16th ACM national meeting
Log Compaction and Garbage Collection: What could they Bring to Each Other?
IWOOOS '95 Proceedings of the 4th International Workshop on Object-Orientation in Operating Systems
Ulterior reference counting: fast garbage collection without a long wait
OOPSLA '03 Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications
RepWeb: replicated Web with referential integrity
Proceedings of the 2003 ACM symposium on Applied computing
The space cost of lazy reference counting
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM SIGPLAN Notices
Garbage collection for embedded systems
Proceedings of the 4th ACM international conference on Embedded software
A unified theory of garbage collection
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Proceedings of the 4th international symposium on Memory management
Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments
Yama: A Scalable Generational Garbage Collector for Java in Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Birrell's distributed reference listing revisited
ACM Transactions on Programming Languages and Systems (TOPLAS)
An on-the-fly reference-counting garbage collector for java
ACM Transactions on Programming Languages and Systems (TOPLAS)
Generating object lifetime traces with Merlin
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiler optimizations for nondeferred reference: counting garbage collection
Proceedings of the 5th international symposium on Memory management
Dusty caches for reference counting garbage collection
MEDEA '05 Proceedings of the 2005 workshop on MEmory performance: DEaling with Applications , systems and architecture
History of programming languages I
SAC: off-the-shelf support for data-parallelism on multicores
Proceedings of the 2007 workshop on Declarative aspects of multicore programming
Data layouts for object-oriented programs
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An efficient on-the-fly cycle collection
ACM Transactions on Programming Languages and Systems (TOPLAS)
A simple and efficient algorithm for cycle collection
ACM SIGPLAN Notices
Overlooking roots: a framework for making nondeferred reference-counting garbage collection fast
Proceedings of the 6th international symposium on Memory management
Overview of garbage collection in symbolic computing
ACM SIGPLAN Lisp Pointers
Object ownership profiling: a technique for finding and fixing memory leaks
Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
A principled approach to nondeferred reference-counting garbage collection
Proceedings of the fourth ACM SIGPLAN/SIGOPS international conference on Virtual execution environments
Memory management for self-adjusting computation
Proceedings of the 7th international symposium on Memory management
ACM Lisp Bulletin
Information Processing Letters
Online reorganization of databases
ACM Computing Surveys (CSUR)
Flexible reference-counting-based hardware acceleration for garbage collection
Proceedings of the 36th annual international symposium on Computer architecture
Using prefetching to improve reference-counting garbage collectors
CC'07 Proceedings of the 16th international conference on Compiler construction
Integrating generations with advanced reference counting garbage collectors
CC'03 Proceedings of the 12th international conference on Compiler construction
An efficient multi-processor architecture for parallel cyclic reference counting
VECPAR'02 Proceedings of the 5th international conference on High performance computing for computational science
Incorporating precise garbage collection in an Ada compiler
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Adjunction for garbage collection with application to graph rewriting
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Efficient interpretation using quickening
Proceedings of the 6th symposium on Dynamic languages
An efficient approach to cyclic reference counting based on a coarse-grained search
Information Processing Letters
Data Linkage Dynamics with Shedding
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
On the object-oriented design of reference-counted shadow objects
Proceedings of the 4th International Workshop on Software Engineering for Computational Science and Engineering
Deferred gratification: engineering for high performance garbage collection from the get go
Proceedings of the 2011 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Short-term memory for self-collecting mutators
Proceedings of the international symposium on Memory management
Teaching garbage collection with open source virtual machine
Proceedings of the 2011 conference on Information technology education
Concurrent non-deferred reference counting on the Microgrid: first experiences
IFL'10 Proceedings of the 22nd international conference on Implementation and application of functional languages
Cyclic reference counting by typed reference fields
Computer Languages, Systems and Structures
Hardware concurrent garbage collection for short-lived objects in mobile java devices
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
An efficient on-the-fly cycle collection
CC'05 Proceedings of the 14th international conference on Compiler Construction
New algorithms and applications of cyclic reference counting
ICGT'06 Proceedings of the Third international conference on Graph Transformations
A lightweight cyclic reference counting algorithm
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Down for the count? Getting reference counting back in the ring
Proceedings of the 2012 international symposium on Memory Management
Autonomous garbage collection: resolving memory leaks in long-running server applications
Computer Communications
CEFP'11 Proceedings of the 4th Summer School conference on Central European Functional Programming School
Resurrector: a tunable object lifetime profiling technique for optimizing real-world programs
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Taking off the gloves with reference counting Immix
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
Non-blocking garbage collection for real-time Android
Proceedings of the 11th International Workshop on Java Technologies for Real-time and Embedded Systems
| Hi-index | 48.34 |
An important property of the Newell Shaw-Simon scheme for computer storage of lists is that data having multiple occurrences need not be stored at more than one place in the computer. That is, lists may be “overlapped.” Unfortunately, overlapping poses a problem for subsequent erasure. Given a list that is no longer needed, it is desired to erase just those parts that do not overlap other lists. In LISP, McCarthy employs an elegant but inefficient solution to the problem. The present paper describes a general method which enables efficient erasure. The method employs interspersed reference counts to describe the extent of the overlapping.