A construction of distributed reference counting


Moreau, Luc and Duprat, Jean (2001) A construction of distributed reference counting Acta Informatica, 37, pp. 563-595. (doi:10.1007/PL00013315).

Download

[img] PDF acta01 - Accepted Manuscript
Download (352kB)

Description/Abstract

Distributed reference counting is a general purpose technique, which may be used, e.g., to detect termination of distributed programs or to implement distributed garbage collection. We present a distributed reference counting algorithm and a mechanical proof of correctness carried out using the proof assistant Coq. The algorithm is formalised by an abstract machine, and its correctness has two different facets. The safety property ensures that if there exists a reference to a resource, then its reference counter will be strictly positive. Liveness guarantees that if all references to a resource are deleted, its reference counter will eventually become null.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1007/PL00013315
Related URLs:
Organisations: Web & Internet Science
ePrint ID: 258935
Date :
Date Event
2001Published
Date Deposited: 01 Mar 2004
Last Modified: 17 Apr 2017 22:35
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/258935

Actions (login required)

View Item View Item