Abstraction, Refinement and Proof for Probabilistic Systems
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...
| Main Authors: | McIver, Annabelle (Author), Morgan, Carroll (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY :
Springer New York,
2005.
|
| Series: | Monographs in Computer Science,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Abstraction, Refinement and Proof for Probabilistic Systems
by: McIver, Annabelle
Published: (2005) -
Tests and Proofs 5th International Conference, TAP 2011, Zurich, Switzerland, June 30 – July 1, 2011. Proceedings /
Published: (2011) -
Formal Methods for Multicore Programming 15th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2015, Bertinoro, Italy, June 15-19, 2015, Advanced Lectures /
Published: (2015) -
Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems International Autumn School, ROCKS 2012, Vahrn, Italy, October 22-26, 2012, Advanced Lectures /
Published: (2014) -
Rewriting, Computation and Proof Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday /
Published: (2007)