School of Computing

Modelling garbage collection algorithms

Howard Bowman, John Derrick, and Richard E. Jones

In Proceedings of International Computing Symposium, pages 182-196, January 1994 Also in ALP-UK International Workshop on Concurrency in Computational Logic.

Abstract

We show how abstract requirements of garbage collection can be captured using temporal logic. The temporal logic specification can then be used as a basis for process algebra specifications which can involve varying amounts of parallelism. We present two simple CCS specifications as an example, followed by a more complex specification of the cyclic reference counting algorithm. The verification of such algorithms is then briefly discussed.

Download publication 137 kbytes (PostScript)

Bibtex Record

@inproceedings{18,
author = {Howard Bowman and John Derrick and Richard E. Jones},
title = {Modelling Garbage Collection Algorithms},
month = {January},
year = {1994},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {Also in ALP-UK International Workshop on Concurrency in Computational Logic},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1994/18},
    annote = {Describes Cyclic Weighted Reference Counting algorithm using CCS and Temporal Logic},
    booktitle = {Proceedings of International Computing Symposium},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014