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
Download this file (PDF/183kB)
Request a format suitable for use with assistive technology e.g. a screenreader
Postscript Language: English
Download this file (Postscript/140kB)	Preview
Request a format suitable for use with assistive technology e.g. a screenreader

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:	05 Nov 2024 09:59 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/21211 (The current URI for this page, for reference purposes)

University of Kent Author Information

Bowman, Howard.

Creator's ORCID:	https://orcid.org/0000-0003-4736-1869
CReDIT Contributor Roles:

Derrick, John.

Creator's ORCID:
CReDIT Contributor Roles:

Jones, Richard E..

Creator's ORCID:	https://orcid.org/0000-0002-8159-0297
CReDIT Contributor Roles:

Depositors only (login required):

Download Statistics

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