The University of Southampton
University of Southampton Institutional Repository

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).

Record type: Article


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.

PDF acta01 - Accepted Manuscript
Download (352kB)

More information

Published date: 2001
Organisations: Web & Internet Science


Local EPrints ID: 258935
PURE UUID: 2b9919af-e93f-4d34-9276-ea9809916129
ORCID for Luc Moreau: ORCID iD

Catalogue record

Date deposited: 01 Mar 2004
Last modified: 18 Jul 2017 09:27

Export record



Author: Luc Moreau ORCID iD
Author: Jean Duprat

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.