Data Linkage Dynamics with Shedding

Authors:
J. A. Bergstra;C. A. Middelburg
Affiliations:
Informatics Institute, University of Amsterdam, Science Park 904, 1098 XH Amsterdam, the Netherlands/ {J.A.Bergstra,C.A.Middelburg}@uva.nl;(Correspd.) Informatics Institute, University of Amsterdam, Science Park 904, 1098 XH Amsterdam, the Netherlands/ {J.A.Bergstra,C.A.Middelburg}@uva.nl
Venue:
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Year:
2010

Citing 23
Cited 1

Garbage collection in an uncooperative environment

Software—Practice & Experience
Term-rewriting systems with rule priorities

Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Tag-free garbage collection for strongly typed programming languages

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Algebraic specification

Handbook of theoretical computer science (vol. B)
Garbage collection and local variable type-precision and liveness in Java virtual machines

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
A Fortran-Compiled List-Processing Language

Journal of the ACM (JACM)
A real-time garbage collector based on the lifetimes of objects

Communications of the ACM
List processing in real time on a serial computer

Communications of the ACM
On-the-fly garbage collection: an exercise in cooperation

Communications of the ACM
Multiprocessing compactifying garbage collection

Communications of the ACM
On effectiveness of GC in Java

Proceedings of the 2nd international symposium on Memory management
A LISP garbage-collector for virtual-memory computer systems

Communications of the ACM
An efficient machine-independent procedure for garbage collection in various list structures

Communications of the ACM
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
A method for overlapping and erasure of lists

Communications of the ACM
Heap profiling for space-efficient Java

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
On the usefulness of type and liveness accuracy for garbage collection and leak detection

ACM Transactions on Programming Languages and Systems (TOPLAS)
A LISP Garbage Collector Algorithm Using Serial Secondary Storage

A LISP Garbage Collector Algorithm Using Serial Secondary Storage
Establishing local temporal heap safety properties with applications to compile-time memory management

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Heap reference analysis using access graphs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Thread algebra for strategic interleaving

Formal Aspects of Computing
An efficient parallel garbage collection system and ITS correctness proof

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Polarized process algebra and program equivalence

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Data Linkage Algebra, Data Linkage Dynamics, and Priority Rewriting

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study shedding in the setting of data linkage dynamics, a simple model of computation that bears on the use of dynamic data structures in programming. Shedding is complementary to garbage collection. With shedding, each time a link to a data object is updated by a program, it is determined whether or not the link will possibly be used once again by the program, and if not the link is automatically removed. Thus, everything is made garbage as soon as it can be viewed as garbage. By that, the effectiveness of garbage collection becomes maximal.