Abstraction, refinement and proof for probabilistic systems. (Q4650346)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2133316
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Abstraction, refinement and proof for probabilistic systems. |
scientific article; zbMATH DE number 2133316 |
Statements
Abstraction, Refinement and Proof for Probabilistic Systems (English)
0 references
Abstraction, refinement and proof for probabilistic systems. (English)
0 references
11 February 2005
0 references
probabilistic computer systems
0 references
refinement programming models
0 references
assertion-based program reasoning
0 references
0.778639018535614
0 references
0.7773504853248596
0 references
0.7649564146995544
0 references
0.7614825367927551
0 references
0.7600044012069702
0 references
This book presents a methodology for reasoning about probabilistic computer systems. Among the existing methods for the analysis of probabilistic systems, the authors' decision is to focus on logic. The final result is an accessible monograph that integrates three main areas: random/probabilistic algorithms, assertion-based program reasoning and refinement programming models. The material is divided into three major parts; a fourth part contains appendices, bibliography and indexes. Part I treats probabilistic program logic; Part II shows how to build the detailed semantics; and Part III applies the methodology to advanced topics on temporal logic and games.
0 references