Portable and efficient dynamic storage management in Ada

UncheckedDeallocation and the implicit freeing of collections are frequently inadequate or inefficient mechanisms for recycling dynamically allocated storage within large Ada programs. This paper will discuss storage management methods, implemented in portable Ada and based on Mark/Release and reference counting techniques, that have proven to be uaeful for supporting arbitrary-precision arithmetic, language processing, string manipulation, general data abstraction, etc.