A Fortran-Compiled List-Processing Language
Journal of the ACM (JACM)
A note on the formation of free list
Communications of the ACM
The use of threaded lists in constructing a combined ALGOL and machine-like assembly processor
Communications of the ACM
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
Communications of the ACM
Letters to the editor: on the reference counter method
Communications of the ACM
Communications of the ACM
ACM '64 Proceedings of the 1964 19th ACM national conference
Machine-independent computer programming
Machine-independent computer programming
Incremental incrementally compacting garbage collection
SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques
A correctness proof for combinator reduction with cycles
ACM Transactions on Programming Languages and Systems (TOPLAS)
Lively linear Lisp: “look ma, no garbage!”
ACM SIGPLAN Notices
Thermodynamics and garbage collection
ACM SIGPLAN Notices
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
Research Demonstration of a Hardware Reference-Counting Heap
Lisp and Symbolic Computation
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)
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Reducing sweep time for a nearly empty heap
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From recursion to iteration: what are the optimizations?
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Space-Efficient Implementations of Graph Search Methods
ACM Transactions on Mathematical Software (TOMS)
Elements of Data Management Systems
ACM Computing Surveys (CSUR)
A Survey of Data Structures for Computer Graphics Systems
ACM Computing Surveys (CSUR)
Garbage Collection of Linked Data Structures
ACM Computing Surveys (CSUR)
Referencing and Retention in Block-Structured Coroutines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Combining Algebraic and Algorithmic Reasoning: An Approach to the Schorr-Waite Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysis of pointer “rotation”
Communications of the ACM
An efficient garbage compaction algorithm
Communications of the ACM
Design of a LISP-based microprocessor
Communications of the ACM
A fast algorithm for copying list structures
Communications of the ACM
Type-preserving garbage collectors
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An efficient list-moving algorithm using constant workspace
Communications of the ACM
Copying list structures using bounded workspace
Communications of the ACM
Multiprocessing compactifying garbage collection
Communications of the ACM
Curriculum recommendations for graduate professional programs in information systems
Communications of the ACM
A nonrecursive list moving algorithm
Communications of the ACM
Block structures, indirect addressing, and garbage collection
Communications of the ACM
Compact list representation: definition, garbage collection, and system implementation
Communications of the ACM
Sorting sequential files with limited auxiliary storage
ACM-SE 18 Proceedings of the 18th annual Southeast regional conference
Derivation of efficient DAG marking algorithms
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The evolution of list-copying algorithms and the need for structured program verification
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Alias Types for Recursive Data Structures
TIC '00 Selected papers from the Third International Workshop on Types in Compilation
Time/Space Efficient Compressed Pattern Matching
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Some practical methods for rapid combinator reduction
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Garbage collection and task deletion in distributed applicative processing systems
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Abstractions, instantiations, and proofs of marking algorithms
Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Design and Implementation of a Real Time Information Storage and Retrieval System
ACM '71 Proceedings of the 1971 26th annual conference
Active Memory Processor: A Hardware Garbage Collector for Real-Time Java Embedded Devices
IEEE Transactions on Mobile Computing
Time/space efficient compressed pattern matching
Fundamenta Informaticae - Special issue on computing patterns in strings
FUNCTIONAL PEARL: Unfolding pointer algorithms
Journal of Functional Programming
A unified theory of garbage collection
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
MC2: high-performance garbage collection for memory-constrained environments
OOPSLA '04 Proceedings of the 19th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Proving pointer programs in higher-order logic
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
A case study of C source code verification: the Schorr-Waite algorithm
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Rewriting term-graphs with priority
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Efficient pebbling for list traversal synopses with application to program rollback
Theoretical Computer Science
Overview of garbage collection in symbolic computing
ACM SIGPLAN Lisp Pointers
A new fast and safe marking algorithm
ACM Lisp Bulletin
A Needed Rewriting Strategy for Data-Structures with Pointers
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Verification of the Deutsch-Schorr-Waite Marking Algorithm with Modal Logic
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
Data Refinement of Invariant Based Programs
Electronic Notes in Theoretical Computer Science (ENTCS)
Programming with angelic nondeterminism
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving pointer programs in higher-order logic
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
NXTalk: dynamic object-oriented programming in a constrained environment
IWST '09 Proceedings of the International Workshop on Smalltalk Technologies
Efficient pebbling for list traversal synopses
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Non strict confluent rewrite systems for data-structures with pointers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Verification of object-oriented software: The KeY approach
Verification of object-oriented software: The KeY approach
Data Linkage Dynamics with Shedding
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
PICOBIT: a compact scheme system for microcontrollers
IFL'09 Proceedings of the 21st international conference on Implementation and application of functional languages
Dafny: an automatic program verifier for functional correctness
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
A space-efficient list structure tracing algorithm
IEEE Transactions on Computers
Juggrnaut: Graph Grammar Abstraction for Unbounded Heap Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Verification of the Schorr-Waite algorithm - from trees to graphs
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Automated verification of the deutsch-schorr-waite tree-traversal algorithm
SAS'06 Proceedings of the 13th international conference on Static Analysis
An analysis of permutations in arrays
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Analysis of pure methods using garbage collection
Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Time/Space Efficient Compressed Pattern Matching
Fundamenta Informaticae - Computing Patterns in Strings
The rewriting logic semantics project: A progress report
Information and Computation
| Hi-index | 48.42 |
A method for returning registers to the free list is an essential part of any list processing system. In this paper, past solutions of the recovery problem are reviewed and compared. A new algorithm is presented which offers significant advantages of speed and storage utilization. The routine for implementing this algorithm can be written in the list language with which it is to be used, thus insuring a degree of machine independence. Finally, the application of the algorithm to a number of different list structures appearing in the literature is indicated.