Entry Charron-Bost:1995:LTP 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{Charron-Bost:1995:LTP,
  author =       "Bernadette Charron-Bost and Carole Delporte-Gallet and
                 Hugues Fauconnier",
  title =        "Local and Temporal Predicates in Distributed Systems",
  journal =      j-TOPLAS,
  volume =       "17",
  number =       "1",
  pages =        "157--179",
  month =        jan,
  year =         "1995",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/201005.html",
  abstract =     "The definitions of the predicates Possibly $\phi$ and
                 Definitely $\phi$, where $\phi$ is a global predicate
                 of a distributed computation, lead to the definitions
                 of two predicate transformers $p$ and $D$. We show that
                 $p$ plays the same role with respect to {\em time\/} as
                 the predicate transformers $K_{i}$ in knowledge theory
                 play with respect to {\em space}. Pursuing this
                 analogy, we prove that local predicates are exactly the
                 fixed points of the $K_{i}$'s while the stable
                 predicates are the fixed points of p. In terms of the
                 predicate transformers $p$ and $D$, we define a new
                 class of predicates that we call {\em
                 observer-independent\/} predicates and for which the
                 detection of Possibly $\phi$ and Definitely $\phi$ is
                 quite easy. Finally, we establish a temporal
                 counterpart to the knowledge change theorem of Chandy
                 and Misra which formally proves that the global view of
                 a distributed system provided by its various
                 observations does not differ too much from its truth
                 behavior.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "theory; verification",
  subject =      "{\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal
                 Definitions and Theory, Semantics. {\bf C.2.4}:
                 Computer Systems Organization, COMPUTER-COMMUNICATION
                 NETWORKS, Distributed Systems, Distributed
                 applications. {\bf D.2.4}: Software, SOFTWARE
                 ENGINEERING, Program Verification, Assertion checkers.
                 {\bf D.2.5}: Software, SOFTWARE ENGINEERING, Testing
                 and Debugging, Debugging aids.",
}

Related entries