Abstraction, Refinement and Proof for Probabilistic Systems

By: Annabelle McIver, Charles Carroll Morgan

Write A Review

eText | 27 October 2005

At a Glance

Format
PDF

eText

$239.00

or 4 interest-free payments of $59.75 with

Instant online reading in your Booktopia eTextbook Library *

Read online on

Desktop

Tablet

Mobile

Not downloadable to your eReader or an app

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

The book is a focused survey on probabilistic program semantics, conceived to tell a coherent story with a uniform notation. It is grouped into three themes: Part I is for 'users' of the techniques who will be developing actual programs; Part II gives mathematical foundations intended for those studying exactly how it was done and how to build semantic structures/models in their own work; and Part III describes a very 'hot' research direction, temporal logic and model checking. Topics and features: - introduces readers to very up-to-date research in the mathematics of rigorous development of randomized (probabilistic) algorithms - illustrates by example the typical steps necessary in computer science to build a mathematical model of any programming paradigm - presents results of a large and integrated body of research in the area of 'quantitative' program logics An advanced research survey monograph, integrating three major topic areas: random/probabilistic algorithms, assertion-based program reasoning, and refinement programming models. Essential foundation topic for modern sequential programming methodology.