A construction of distributed reference counting

DOI10.1007/PL00013315MaRDI QIDQ5941636zbMATH OpenDBLPWikidataFDO

Authors Luc Moreau, Jean Duprat

Publication date 20 August 2001

Published in Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

distributed reference counting

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Verifying Reference Counting Implementations
• Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm
• An efficient reference counting solution to the distributed garbage collection problem
• Correctness proofs of distributed termination algorithms
• scientific article; zbMATH DE number 3926219

Cited in

(7)

• Verifying Reference Counting Implementations
• scientific article; zbMATH DE number 1863302 (Why is no real title available?)
• Testing and Proving Distributed Algorithms in Constructive Type Theory
• An efficient reference counting solution to the distributed garbage collection problem
• Formal and incremental construction of distributed algorithms: on the distributed reference counting algorithm
• An inherent bottleneck in distributed counting
• Reference count analysis with shallow aliasing

Describes a project that uses

Uses Software

• NeXeme
• Coq

This page was built for publication: A construction of distributed reference counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941636)