Quantitative program logic and performance in probabilistic distributed algorithms

Annabelle K. McIver

Quantitative program logic and performance in probabilistic distributed algorithms

Annabelle K. McIver^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

2 Citations (Scopus)

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].

Original language	English
Title of host publication	Formal Methods for Real-Time and Probabilistic Systems
Subtitle of host publication	5th International AMAST Workshop, ARTS'99, Bamberg, Germany, May 26-28, 1999, Proceedings
Editors	Jost-Pieter Katoen
Place of Publication	Berlin
Publisher	Springer, Springer Nature
Pages	19-33
Number of pages	15
Volume	1601
Edition	1
ISBN (Electronic)	9783540487784
ISBN (Print)	9783540660101
Publication status	Published - 1999
Externally published	Yes
Event	5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999 - Bamberg, Germany Duration: 26 May 1999 → 28 May 1999

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer-Verlag Berlin Heidelberg
Volume	1601
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999
Country/Territory	Germany
City	Bamberg
Period	26/05/99 → 28/05/99

Cite this

McIver, A. K. (1999). Quantitative program logic and performance in probabilistic distributed algorithms. In J.-P. Katoen (Ed.), Formal Methods for Real-Time and Probabilistic Systems: 5th International AMAST Workshop, ARTS'99, Bamberg, Germany, May 26-28, 1999, Proceedings (1 ed., Vol. 1601, pp. 19-33). (Lecture Notes in Computer Science; Vol. 1601). Springer, Springer Nature.

McIver, Annabelle K. / Quantitative program logic and performance in probabilistic distributed algorithms. Formal Methods for Real-Time and Probabilistic Systems: 5th International AMAST Workshop, ARTS'99, Bamberg, Germany, May 26-28, 1999, Proceedings. editor / Jost-Pieter Katoen. Vol. 1601 1. ed. Berlin : Springer, Springer Nature, 1999. pp. 19-33 (Lecture Notes in Computer Science).

@inproceedings{ca03a481c9754e90a9b7e28f70d6e06d,

title = "Quantitative program logic and performance in probabilistic distributed algorithms",

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].",

author = "McIver, {Annabelle K.}",

year = "1999",

language = "English",

isbn = "9783540660101",

volume = "1601",

series = "Lecture Notes in Computer Science",

publisher = "Springer, Springer Nature",

pages = "19--33",

editor = "Jost-Pieter Katoen",

booktitle = "Formal Methods for Real-Time and Probabilistic Systems",

address = "United States",

edition = "1",

note = "5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999 ; Conference date: 26-05-1999 Through 28-05-1999",

}

McIver, AK 1999, Quantitative program logic and performance in probabilistic distributed algorithms. in J-P Katoen (ed.), Formal Methods for Real-Time and Probabilistic Systems: 5th International AMAST Workshop, ARTS'99, Bamberg, Germany, May 26-28, 1999, Proceedings. 1 edn, vol. 1601, Lecture Notes in Computer Science, vol. 1601, Springer, Springer Nature, Berlin, pp. 19-33, 5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999, Bamberg, Germany, 26/05/99.

Quantitative program logic and performance in probabilistic distributed algorithms. / McIver, Annabelle K.
Formal Methods for Real-Time and Probabilistic Systems: 5th International AMAST Workshop, ARTS'99, Bamberg, Germany, May 26-28, 1999, Proceedings. ed. / Jost-Pieter Katoen. Vol. 1601 1. ed. Berlin: Springer, Springer Nature, 1999. p. 19-33 (Lecture Notes in Computer Science; Vol. 1601).

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Quantitative program logic and performance in probabilistic distributed algorithms

AU - McIver, Annabelle K.

PY - 1999

Y1 - 1999

N2 - 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].

AB - 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].

UR - http://www.scopus.com/inward/record.url?scp=0038419874&partnerID=8YFLogxK

M3 - Conference proceeding contribution

AN - SCOPUS:0038419874

SN - 9783540660101

VL - 1601

T3 - Lecture Notes in Computer Science

SP - 19

EP - 33

BT - Formal Methods for Real-Time and Probabilistic Systems

A2 - Katoen, Jost-Pieter

PB - Springer, Springer Nature

CY - Berlin

T2 - 5th International on Algebraic Methodology And Software Technology, AMAST 1999, held with Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS 1999

Y2 - 26 May 1999 through 28 May 1999

ER -

Quantitative program logic and performance in probabilistic distributed algorithms

Abstract

Publication series

Other

Other files and links

Fingerprint

Cite this