<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>8033</REFNUM><AUTHORS><AUTHOR>Moreau,L.</AUTHOR><AUTHOR>Dickman,P.</AUTHOR><AUTHOR>Jones,R.E.</AUTHOR></AUTHORS><YEAR>2005</YEAR><TITLE>Birrell's Distributed Reference Listing Revisited</TITLE><PLACE_PUBLISHED>ACM Transactions on Programming Languages and Systems (TOPLAS) Volume 27, #6, pp1344--1395, 2005</PLACE_PUBLISHED><PUBLISHER>ACM Press</PUBLISHER><PAGES>1344--1395</PAGES><ISBN>0164-0925</ISBN><LABEL>Moreau:2005:8033</LABEL><ABSTRACT>The Java RMI collector is arguably the most widely used distributed garbage collector. Its distributed reference listing algorithm was introduced by Birrell in the context of Network Objects, where the description was informal and heavily biased toward implementation. In this paper, we formalise this algorithm in an implementation-independent manner, which allows us to clarify weaknesses of the initial presentation. In particular, we discover cases critical to the correctness of the algorithm that are not accounted for by Birrell. We use our formalisation to derive an invariant-based proof of correctness of the algorithm that avoids notoriously difficult temporal reasoning. Furthermore, we offer a novel graphical representation of the state transition diagram, which we use to provide intuitive explanations of the algorithm and to investigate its tolerance to faults in a systematic manner. Finally, we examine how the algorithm may be optimised, either by placing constraints on message channels or by tightening the coupling between application program and distributed garbage collector.</ABSTRACT><NOTES>Available from ACM Digital Library</NOTES><URL>http://doi.acm.org/10.1145/1108970.1108976</URL></RECORD></RECORDS></XML>