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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Gratis für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerAnbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Artikel-Nr. ABNR-249096
Anzahl: 2 verfügbar
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Artikel-Nr. ABNR-81904
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9780387401157_new
Anzahl: Mehr als 20 verfügbar
Anbieter: moluna, Greven, Deutschland
Gebunden. Zustand: New. This unique, example-driven monograph integrates coverage of random/probabilistic algorithms, assertion-based program reasoning, and refinement programming models, providing a focused survey on probabilistic program semanticsIllustrates by example th. Artikel-Nr. 5910284
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Neuware - 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 approachesThis 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. Artikel-Nr. 9780387401157
Anzahl: 2 verfügbar