Abstraction, Refinement and Proof for Probabilistic Systems

Abstraction, Refinement and Proof for Probabi ...
Annabelle McIver, Charles C. M ...
Locate

My Reading Lists:

Create a new list



Buy this book

Last edited by ImportBot
February 25, 2022 | History

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 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 and systems development.

Researchers, computer scientists, and advanced undergraduates and graduates studying programming or probabilistic systems will find the work an authoritative and essential resource text.

Publish Date
Language
English

Buy this book

Previews available in: English

Edition Availability
Cover of: Abstraction, Refinement and Proof for Probabilistic Systems
Abstraction, Refinement and Proof for Probabilistic Systems
Nov 19, 2010, Springer
paperback
Cover of: Abstraction, Refinement and Proof for Probabilistic Systems
Abstraction, Refinement and Proof for Probabilistic Systems
2005, Springer London, Limited
in English
Cover of: Abstraction, Refinement and Proof for Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement and Proof for Probabilistic Systems (Monographs in Computer Science)
November 19, 2004, Springer
in English

Add another edition?

Book Details


Classifications

Library of Congress
QA76.758

The Physical Object

Pagination
xx, 388

Edition Identifiers

Open Library
OL37102419M
ISBN 13
9780387270067

Work Identifiers

Work ID
OL18357043W

Source records

Better World Books record

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
February 25, 2022 Created by ImportBot Imported from Better World Books record