Calculating a garbage collector
- In this paper we give a calculational account of a garbage collection algorithm. There have been a number of papers with a similar programme. However, these treatments either were not completely formal or suffered from using an inconvenient representation of the problem. With this paper we want to introduce partial maps and their algebraic properties as a vehicle for treating pointer structures, as dealt with in garbage collection, both conveniently and formally. Moreover, we want to develop the algorithms to a level which can actually be transcribed directly into machine code allowing the use of overwriting and the like; this was not achieved in most of the papers cited. It also turns out that the theory of finite maps allows very concise high-level specifications of the subproblems involved in garbage collection.
Author: | U. Berger, W. Meixner, Bernhard MöllerGND |
---|---|
URN: | urn:nbn:de:bvb:384-opus4-593844 |
Frontdoor URL | https://opus.bibliothek.uni-augsburg.de/opus4/59384 |
ISBN: | 978-3-540-54576-7OPAC |
Parent Title (English): | Lecture Notes of Computer Science |
Publisher: | Springer |
Place of publication: | Berlin |
Type: | Article |
Language: | English |
Year of first Publication: | 1991 |
Publishing Institution: | Universität Augsburg |
Release Date: | 2019/09/04 |
Volume: | 544 |
First Page: | 135 |
Last Page: | 192 |
DOI: | https://doi.org/10.1007/BFb0018273 |
Institutes: | Fakultät für Angewandte Informatik |
Fakultät für Angewandte Informatik / Institut für Informatik | |
Fakultät für Angewandte Informatik / Institut für Informatik / Professur für Programmiermethodik und Multimediale Informationssysteme | |
Dewey Decimal Classification: | 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik |
Licence (German): | Deutsches Urheberrecht |