Abstraction, Refinement and Proof for Probabilistic Systems (Monographs in Computer Science)

By T.S. Lim

This book integrates coverage of random/probabilistic algorithms, assertion-based program reasoning, and refinement programming models, providing a highly focused survey on probabilistic program semantics. It illustrates by example the typical steps necessary in computer science to build a mathematical model of any programming paradigm, addressing an essential foundation topic for modern sequential programming methodology.

• Format: Hardcover
• Language: English
• ISBN: 0387401156
• ISBN13: 9780387401157
• Release Date: November 2004
• Publisher: Springer
• Length: 388 Pages
• Weight: 1.53 lbs.
• Dimensions: 0.9" x 6.2" x 9.4"