Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Abstraction, Refinement and Proof for Probabilistic Systems - Annabelle McIver,Charles Carroll Morgan

inglise keel
2004-11-19
193,01 € 321,68 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 22-28 tööpäeva jooksul

30-päevane tagastamisõigus

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 ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Annabelle McIver, Charles Carroll Morgan
Kirjastaja Springer New York
Väljalaskeaasta 2004
Kaanetüüp Kõvakaaneline
EAN 9780387401157
Kirjuta oma arvustus
Te vaatate: Abstraction, Refinement and Proof for Probabilistic Systems
Teie hinnang:

Goodreads'i arvustused

193,01 € 321,68 €