Entry Moreau:2005:BDR from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Moreau:2005:BDR,
  author =       "Luc Moreau and Peter Dickman and Richard Jones",
  title =        "{Birrell}'s distributed reference listing revisited",
  journal =      j-TOPLAS,
  volume =       "27",
  number =       "6",
  pages =        "1344--1395",
  month =        nov,
  year =         "2005",
  CODEN =        "ATPSDT",
  DOI =          "http://doi.acm.org/10.1145/1108970.1108976",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Wed Jan 11 05:23:15 MST 2006",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toplas/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  abstract =     "The Java RMI collector is arguably the most widely
                 used distributed garbage collector. Its distributed
                 reference listing algorithm was introduced by Birrell
                 et al. in the context of Network Objects, where the
                 description was informal and heavily biased toward
                 implementation. In this article, we formalize 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 were not
                 accounted for by Birrell. We use our formalization 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 optimized, either by placing
                 constraints on message channels or by tightening the
                 coupling between the application program and
                 distributed garbage collector.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
}

Related entries