Abstraction, Refinement and Proof for Probabilistic Systems

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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: McIver, Annabelle (Autor), Morgan, Charles Carroll (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer New York : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Monographs in Computer Science,
Temas:
Software engineering.
Probabilities.
Computer programming.
Computer science.
Compilers (Computer programs).
Machine theory.
Software Engineering.
Probability Theory.
Programming Techniques.
Computer Science Logic and Foundations of Programming.
Compilers and Interpreters.
Formal Languages and Automata Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares