Modelling Garbage Collection Algorithms --- Extend abstract

Bowman, Howard and Derrick, John and Jones, Richard E. (1994) Modelling Garbage Collection Algorithms --- Extend abstract. In: Proceedings of Principles of Distributed Computing'94. (Full text available)

PDF
Download (167kB)
[img]
Preview
Postscript
Download (140kB)
[img]
Preview

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.

Item Type: Conference or workshop item (UNSPECIFIED)
Additional information: Extended abstract of CCS94
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Faculties > Science Technology and Medical Studies > School of Computing > Systems Architecture Group
Depositing User: Mark Wheadon
Date Deposited: 14 Aug 2009 17:04
Last Modified: 27 May 2014 13:57
Resource URI: http://kar.kent.ac.uk/id/eprint/21211 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year