A Construction of Distributed Reference Counting

Moreau, Luc and Duprat, Jean (2001) A Construction of Distributed Reference Counting. Acta Informatica, 37, 563-595.


Full text not available from this repository.


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
Related URLs:
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Web & Internet Science
ePrint ID: 258935
Accepted Date and Publication Date:
Date Deposited: 01 Mar 2004
Last Modified: 31 Mar 2016 13:59
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/258935

Actions (login required)

View Item View Item