Check nearby libraries
Buy this book
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.
Check nearby libraries
Buy this book
Previews available in: English
Subjects
Probabilities, Systems engineering, Engineering mathematics, Logic design, Computer science, Computer programming, Mathématiques de l'ingénieur, Probabilités, Ingénierie des systèmes, Programming Techniques, Logics and Meanings of Programs, Programming Languages, Compilers, Interpreters, Mathematical Logic and Formal LanguagesEdition | Availability |
---|---|
1
Abstraction, Refinement and Proof for Probabilistic Systems
Nov 19, 2010, Springer
paperback
1441923128 9781441923127
|
zzzz
|
2
Abstraction, Refinement and Proof for Probabilistic Systems
2005, Springer London, Limited
in English
038727006X 9780387270067
|
zzzz
|
3
Abstraction, Refinement and Proof for Probabilistic Systems (Monographs in Computer Science)
November 19, 2004, Springer
in English
0387401156 9780387401157
|
aaaa
|
Book Details
First Sentence
"Since the mid-1970's, any serious student of rigorous program development will have encountered "assertions about programs" - they are predicates which, when inserted into program code, are supposed to be "true at that point of the program.""
Classifications
ID Numbers
Source records
amazon.com recordLibrary of Congress MARC record
Internet Archive item record
Internet Archive item record
Internet Archive item record
Library of Congress MARC record
Better World Books record
Internet Archive item record
Promise Item
marc_columbia MARC record
harvard_bibliographic_metadata record
Community Reviews (0)
Feedback?August 12, 2024 | Edited by MARC Bot | import existing book |
December 30, 2022 | Edited by MARC Bot | import existing book |
February 26, 2022 | Edited by ImportBot | import existing book |
June 28, 2019 | Edited by MARC Bot | import existing book |
February 5, 2019 | Created by MARC Bot | import existing book |