TY  - JOUR
A1  - Berger, U.
A1  - Meixner, W.
A1  - Möller, Bernhard
T1  - Calculating a garbage collector
T2  - Lecture Notes of Computer Science
N2  - 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.
Y1  - 2019
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/59384
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-593844
SN  - 978-3-540-54576-7
VL  - 544
SP  - 135
EP  - 192
PB  - Springer
CY  - Berlin
ER  -