Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms

Authors:
Annabelle McIver
Affiliations:
-
Venue:
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Year:
1999

Citing 10
Cited 0

Verification of probabilistic programs

SIAM Journal on Computing
Parallel program design: a foundation

Parallel program design: a foundation
Proving time bounds for randomized distributed algorithms

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Probabilistic predicate transformers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Probabilistic models for the guarded command language

Science of Computer Programming - Special issue: on formal specifications: foundations, methods, tools and applications: selected papers from the FMTA '95 conference (29–31 May 1995, Konstancin n. Warsaw, Poland)
A Discipline of Programming

A Discipline of Programming
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Temporal Logics for the Specification of Performance and Reliability

STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
The Generalised Substitution Language Extended to Probabilistic Programs

B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
A probabilistic PDL

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we show how quantitative program logic [14] provides a formal framework in which to promote standard techniques of program analysis to a context where probability and nondeterminism interact, a situation common to probabilistic distributed algorithms. We show that overall performance can be formulated directly in the logic and that it can be derived from local properties of components. We illustrate the methods with an analysis of performance of the probabilistic dining philosophers [10].