Modelling Garbage Collection Algorithms --- Extend abstract

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

PDF Language: English
Click to download this file (183kB)
This file may not be suitable for users of assistive technology. Request an accessible format
Postscript Language: English
Click to download this file (140kB) Preview	Preview
This file may not be suitable for users of assistive technology. Request an accessible format

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:	Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User:	Richard Jones
Date Deposited:	14 Aug 2009 17:04 UTC
Last Modified:	16 Nov 2021 09:59 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/21211 (The current URI for this page, for reference purposes)
Bowman, Howard:	https://orcid.org/0000-0003-4736-1869
Jones, Richard E.:	https://orcid.org/0000-0002-8159-0297

Depositors only (login required):

Download Statistics

Total unique views for this document in KAR since July 2020. For more details click on the image.