© University of Kent - Contact | Feedback | Legal
The University of Kent, Canterbury, Kent, CT2 7NZ, T +44 (0)1227 764000
Modelling garbage collection algorithms - extend abstract
Howard Bowman, John Derrick, and Richard E. Jones
In Proceedings of Principles of Distributed Computing'94, January 1994 Extended abstract of CCS94.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{19,
author = {Howard Bowman and John Derrick and Richard E. Jones},
title = {Modelling Garbage Collection Algorithms --- Extend abstract},
month = {January},
year = {1994},
pages = {},
keywords = {},
note = {Extended abstract of CCS94},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1994/19},
booktitle = {Proceedings of Principles of Distributed Computing'94},
}