rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Abstraction, Refinement and Proof for Probabilistic Systems
  name:
    name part: McIver, Annabelle.
    role:
      role term: creator
    role:
      role term: author.
  name:
    name part: Morgan, Carroll.
    role:
      role term: author.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: xxu
    date issued: 2005
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XX, 388 p. 63 illus. online resource.
  abstract: Probabilistic techniques are increasingly being employed in computer programs and systems because they can increase efficiency in sequential algorithms, enable otherwise nonfunctional distribution applications, and allow quantification of risk and safety in general. This makes operational models of how they work, and logics for reasoning about them, extremely important. Abstraction, Refinement and Proof for Probabilistic Systems presents a rigorous approach to modeling and reasoning about computer systems that incorporate probability. Its foundations lie in traditional Boolean sequential-program logic—but its extension to numeric rather than merely true-or-false judgments takes it much further, into areas such as randomized algorithms, fault tolerance, and, in distributed systems, almost-certain symmetry breaking. The presentation begins with the familiar "assertional" style of program development and continues with increasing specialization: Part I treats probabilistic program logic, including many examples and case studies; Part II sets out the detailed semantics; and Part III applies the approach to advanced material on temporal calculi and two-player games. Topics and features: * Presents a general semantics for both probability and demonic nondeterminism, including abstraction and data refinement * Introduces readers to the latest mathematical research in rigorous formalization of randomized (probabilistic) algorithms * Illustrates by example the steps necessary for building a conceptual model of probabilistic programming "paradigm" * Considers results of a large and integrated research exercise (10 years and continuing) in the leading-edge area of "quantitative" program logics * Includes helpful chapter-ending summaries, a comprehensive index, and an appendix that explores alternative approaches This accessible, focused monograph, written by international authorities on probabilistic programming, develops an essential foundation topic for modern programming an…
  table of contents: Probabilistic guarded commands and their refinement logic -- to pGCL: Its logic and its model -- Probabilistic loops: Invariants and variants -- Case studies in termination: Choice coordination, the dining philosophers, and the random walk -- Probabilistic data refinement: The steam boiler -- Semantic structures -- Theory for the demonic model -- The geometry of probabilistic programs -- Proved rules for probabilistic loops -- Infinite state spaces, angelic choice and the transformer hierarchy -- Advanced topics: Quantitative modal logic and game interpretations -- Quantitative temporal logic: An introduction -- The quantitative algebra of qTL -- The quantitative modal ?-calculus, and gambling games.
  note: by Annabelle McIver, Carroll Morgan.
  subject:
    topic: Computer science
  subject:
    topic: Software engineering
  subject:
    topic: Computer programming
  subject:
    topic: Programming languages (Electronic computers)
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Probabilities
  subject:
    topic: Computer Science
  subject:
    topic: Software Engineering/Programming and Operating Systems
  subject:
    topic: Probability Theory and Stochastic Processes
  subject:
    topic: Programming Techniques
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Programming Languages, Compilers, Interpreters
  subject:
    topic: Mathematical Logic and Formal Languages
  classification: QA76.758
  classification: 005.1
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Monographs in Computer Science
  identifier: 9780387270067
  identifier: http://dx.doi.org/10.1007/b138392
  record info:
    record creation date: 100301
    record change date: 20151204154613.0
    record identifier: 978-0-387-27006-7