Data structures using Pascal
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Distributed garbage collection using reference counting
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
An efficient garbage collection scheme for parallel computer architectures
Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
ANNA: a language for annotating Ada programs
ANNA: a language for annotating Ada programs
A realistic compiler generator based on high-level semantics: another progress report
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
End-to-end arguments in system design
ACM Transactions on Computer Systems (TOCS)
Data Structures and Algorithms
Data Structures and Algorithms
Data Structures and Their Implementation
Data Structures and Their Implementation
Issues in Ada Compiler Technology
Computer
Rational for the design of reusable abstract data types implemented in Ada
ACM SIGAda Ada Letters
Structured programming with limited private types in Ada: nesting if for the soaring eagles
ACM SIGAda Ada Letters
Safe and leakproof resource management using Ada83 limited types
ACM SIGAda Ada Letters
Abstract data types are under full control with Ada 9X
TRI-Ada '94 Proceedings of the conference on TRI-Ada '94
| Hi-index | 0.00 |
Given Ada's semantics regarding dynamically allocated objects, do programmers believe that storage reclamation is impractical? At first glance, it would appear that given these semantics, one cannot derive workable models for reclaiming all unneeded objects. In reality, Ada provides features that allow programmers to define storage reclamation models that operate at close to 100 percent capacity. This paper describes methods by which Ada programs can reclaim objects. Examples of Ada storage reclamation models are presented along with their associated algorithms. A taxonomy of units that perform storage reclamation is also discussed.