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.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Web & Internet Science
|Date Deposited:||01 Mar 2004|
|Last Modified:||15 Aug 2012 03:10|
|Contributors:||Moreau, Luc (Author)
Duprat, Jean (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||6|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)