Entry Dolev:2009:SSP 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{Dolev:2009:SSP,
  author =       "Shlomi Dolev and Yinnon Haviv and Mooly Sagiv",
  title =        "Self-stabilization preserving compiler",
  journal =      j-TOPLAS,
  volume =       "31",
  number =       "6",
  pages =        "22:1--22:22",
  month =        aug,
  year =         "2009",
  CODEN =        "ATPSDT",
  DOI =          "http://doi.acm.org/10.1145/1552309.1552312",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Mon Aug 24 13:23:06 MDT 2009",
  bibsource =    "http://www.acm.org/pubs/contents/journals/toplas/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  abstract =     "Self-stabilization is an elegant approach for
                 designing fault tolerant systems. A system is
                 considered self-stabilizing if, starting in any state,
                 it converges to the desired behavior. Self-stabilizing
                 algorithms were designed for solving fundamental
                 distributed tasks, such as leader election, token
                 circulation and communication network protocols. The
                 algorithms were expressed using guarded commands or
                 pseudo-code. The realization of these algorithms
                 requires the existence of a (self-stabilizing)
                 infrastructure such as a self-stabilizing
                 microprocessor and a self-stabilizing operating system
                 for their execution. Moreover, the high-level
                 description of the algorithms needs to be converted
                 into machine language of the microprocessor. In this
                 article, we present our design for a self-stabilization
                 preserving compiler. The compiler we designed and
                 implemented transforms programs written in a language
                 similar to the abstract state machine (ASM). The
                 compiler preserves the stabilization property of the
                 high level program.",
  acknowledgement = ack-nhfb,
  articleno =    "22",
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "abstract state machines; Compilers;
                 self-stabilization",
}

Related entries