Entry Brogi:1991:CLS 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{Brogi:1991:CLS,
  author =       "Antonio Brogi and Paolo Ciancarini",
  title =        "The Concurrent Language, {Shared Prolog}",
  journal =      j-TOPLAS,
  volume =       "13",
  number =       "1",
  pages =        "99--123",
  month =        jan,
  year =         "1991",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Fri Jan 5 07:58:42 MST 1996",
  bibsource =    "Compiler/Compiler.Lins.bib; Compiler/TOPLAS.bib;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib;
                 Misc/IMMD_IV.bib",
  URL =          "http://www.acm.org/pubs/toc/Abstracts/0164-0925/102807.html",
  abstract =     "Shared Prolog is a new concurrent logic language. A
                 Shared Prolog system is composed of a set of parallel
                 agents that are Prolog programs extended by a guard
                 mechanism. The programmer controls the granularity of
                 parallelism, coordinating communication and
                 synchronization of the agents via a centralized data
                 structure. The communication mechanism is inherited
                 from the blackboard model of problem solving.
                 Intuitively, the granularity of the logic processes to
                 be elaborated in parallel is large, while the resources
                 shared on the blackboard can be very fined
                 grained.\par

                 An operational semantics for Shared Prolog is given in
                 terms of a distributed model. Through an abstract
                 notion of computation, the kinds of parallelism
                 supported by the language, as well as properties of
                 infinite computations, such as local deadlocks, are
                 studied.\par

                 The expressiveness of the language is shown with
                 respect to the specification of two classes of
                 applications: metaprogramming and blackboard systems.",
  acknowledgement = ack-nhfb # " and " # ack-pb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  keywords =     "languages; theory",
  subject =      "{\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications. {\bf I.2.3}: Computing Methodologies,
                 ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving,
                 Logic programming. {\bf D.3.1}: Software, PROGRAMMING
                 LANGUAGES, Formal Definitions and Theory, Semantics.
                 {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language
                 Classifications, Concurrent, distributed, and parallel
                 languages. {\bf F.4.1}: Theory of Computation,
                 MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical
                 Logic, Logic programming.",
}

Related entries