{
"item_title" : "Abstraction, Refinement and Proof for Probabilistic Systems",
"item_author" : [" Annabelle McIver", "Charles Carroll Morgan "],
"item_description" : "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. ",
"item_img_path" : "https://covers2.booksamillion.com/covers/bam/0/38/740/115/0387401156_b.jpg",
"price_data" : {
"retail_price" : "169.99", "online_price" : "169.99", "our_price" : "169.99", "club_price" : "169.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Abstraction, Refinement and Proof for Probabilistic Systems
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780387401157
- ISBN-10: 0387401156
- Publisher: Springer
- Publish Date: November 2004
- Dimensions: 9.42 x 6.18 x 0.92 inches
- Shipping Weight: 1.53 pounds
- Page Count: 388
Related Categories
