A Construction of Distributed Reference Counting
Moreau, Luc and Duprat, Jean (1999) A Construction of Distributed Reference Counting.
Download
Full text not available from this repository.
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: | Monograph (Technical Report) |
|---|---|
| Additional Information: | Address: Ecole Normale Sup\'erieure, Lyon, RR1999-18 |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science |
| Item ID: | 252744 |
| Date Deposited: | 17 Apr 2000 |
| Last Modified: | 02 Mar 2012 11:37 |
| Contributors: | Moreau, Luc (Author) Duprat, Jean (Author) |
| Date: | 1999 |
| Additional Information: | Address: Ecole Normale Sup\'erieure, Lyon, RR1999-18 |
| Status: | Published |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/252744 |
Actions (login required)
 |
View Item |
