Entry VanRoy:1997:MOD 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{VanRoy:1997:MOD,
  author =       "Peter {Van Roy} and Seif Haridi and Per Brand and Gert
                 Smolka and Michael Mehl and Ralf Scheidhauer",
  title =        "Mobile Objects in {Distributed Oz}",
  journal =      j-TOPLAS,
  volume =       "19",
  number =       "5",
  pages =        "804--851",
  month =        sep,
  year =         "1997",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Wed Dec 3 16:28:05 MST 1997",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org:80/pubs/citations/journals/toplas/1997-19-5/p804-van_roy/",
  abstract =     "Some of the most difficult questions to answer when
                 designing a distributed application are related to
                 mobility: what information to transfer between sites
                 and when and how to transfer it. Network-transparent
                 distribution, the property that a program's behavior is
                 independent of how it is partitioned among sites, does
                 not directly address these questions. Therefore we
                 propose to extend all language entities with a network
                 behavior that enables {\em efficient\/} distributed
                 programming by giving the programmer a simple and
                 predictable control over network communication
                 patterns. In particular, we show how to give object an
                 arbitrary mobility behavior that is independent of the
                 object definition. In this way, the syntax and
                 semantics of objects are the same regardless of whether
                 they are used as stationary servers, mobile agents, or
                 simply as caches. These ideas have been implemented in
                 Distributed Oz, a concurrent object-oriented language
                 that is state aware and has dataflow synchronization.
                 We prove that the implementation of objects in
                 Distributed Oz is network transparent. To satisfy the
                 predictability condition, the implementation avoids
                 forwarding chains through intermediate sites. The
                 implementation is an extension to the publicly
                 available DFKI Oz 2.0 system.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "algorithms; languages; theory",
  subject =      "{\bf D.1.3} Software, PROGRAMMING TECHNIQUES,
                 Concurrent Programming, Distributed programming. {\bf
                 D.3.2} Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Concurrent, distributed, and parallel
                 languages. {\bf F.3.2} Theory of Computation, LOGICS
                 AND MEANINGS OF PROGRAMS, Semantics of Programming
                 Languages, Operational semantics.",
}

Related entries