
Abstraction, Refinement and Proof for Probabilistic Systems
Springer (Publisher)
Published on 19. November 2010
Book
Paperback/Softback
XX, 388 pages
978-1-4419-2312-7 (ISBN)
Description
This book integrates coverage of random/probabilistic algorithms, assertion-based program reasoning, and refinement programming models, providing a highly focused survey on probabilistic program semantics. It illustrates by example the typical steps necessary in computer science to build a mathematical model of any programming paradigm, addressing an essential foundation topic for modern sequential programming methodology.
More details
Series
Edition
Softcover reprint of hardcover 1st ed. 2005
Language
English
Place of publication
New York
United States
Target group
Professional and scholarly
Research
Illustrations
63 s/w Abbildungen
XX, 388 p. 63 illus.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 22 mm
Weight
610 gr
ISBN-13
978-1-4419-2312-7 (9781441923127)
DOI
10.1007/b138392
Schweitzer Classification
Other editions
Additional editions

Annabelle McIver | Charles Carroll Morgan
Abstraction, Refinement and Proof for Probabilistic Systems
Book
11/2004
Springer
€160.49
Shipment within 5-7 days
Persons
Mário S. Alvim is assistant professor in the Computer Science Department of the Universidade Federal de Minas Gerais in Belo Horizonte. His current research interests include formal methods for security and privacy, as well as applications of quantitative information flow to fields beyond security. Kostas Chatzikokolakis is associate professor at the University of Athens. He works on security and privacy, in particular quantitative information flow, location privacy, and differential privacy. Annabelle McIver is professor in the Dept. of Computing at Macquarie University in Sydney. She works on mathematical techniques for the verification of probabilistic systems. Carroll Morgan is professor in the School of Engineering and Computer Science at the University of New South Wales, and is affiliated with the Trustworthy Systems Group of CSIRO's Data61. His current interests are quantitative information flow, program derivation (including security), and proved correctness of multicore operating-system kernels. Catuscia Palamidessi is director of research at Inria Saclay. She is the leader of COMÈTE, a research team in the Inria and École Polytechnique shared lab. Her main research interests are quantitative information flow, privacy, and concurrency theory. Geoffrey Smith is professor in the School of Computing and Information Sciences of Florida International University in Miami. His current research interests include quantitative information flow and its applications to cryptography.
Content
Probabilistic guarded commands and their refinement logic.- to pGCL: Its logic and its model.- Probabilistic loops: Invariants and variants.- Case studies in termination: Choice coordination, the dining philosophers, and the random walk.- Probabilistic data refinement: The steam boiler.- Semantic structures.- Theory for the demonic model.- The geometry of probabilistic programs.- Proved rules for probabilistic loops.- Infinite state spaces, angelic choice and the transformer hierarchy.- Advanced topics: Quantitative modal logic and game interpretations.- Quantitative temporal logic: An introduction.- The quantitative algebra of qTL.- The quantitative modal ?-calculus, and gambling games.