Abstraction, refinement and proof for probabilistic systems

Abstraction, refinement and proof for probabilistic systems

by Annabelle McIver, Charles C. Morgan

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
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.

Discuss Abstraction, refinement and proof for probabilistic systems with other readers

Join or start a book club for Abstraction, refinement and proof for probabilistic systems on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Abstraction, refinement and proof for probabilistic systems?

Sign up free on Readfeed, then browse public clubs or start your own club with Abstraction, refinement and proof for probabilistic systems as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Abstraction, refinement and proof for probabilistic systems with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Abstraction, refinement and proof for probabilistic systems with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.