| Abstraction, Refinement and Proof for Probabilistic Systems 2005 Edition Contributor(s): McIver, Annabelle (Author), Morgan, Charles Carroll (Author) |
|
 |
ISBN: 0387401156 ISBN-13: 9780387401157 Publisher: Springer OUR PRICE: $161.49 Product Type: Hardcover - Other Formats Published: November 2004 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Computers | Computer Science - Computers | Programming Languages - General - Computers | Compilers |
| Dewey: 005.1 |
| LCCN: 2004057839 |
| Series: Monographs in Computer Science |
| Physical Information: 0.92" H x 6.18" W x 9.42" (1.53 lbs) 388 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Illustrates by example the typical steps necessary in computer science to build a mathematical model of any programming paradigm .
|