Refinement Algebra for Probabilistic Programs

Larissa Meinicke; Kim Solin

doi:10.1016/j.entcs.2008.02.020

Refinement Algebra for Probabilistic Programs

Larissa Meinicke^*, Kim Solin

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

We propose an abstract refinement algebra for reasoning about probabilistic programs in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled, has certain failure or does not have certain failure, respectively. As an application, refinement rules for probabilistic action systems are derived in the algebra.

Original language	English
Pages (from-to)	177-195
Number of pages	19
Journal	Electronic Notes in Theoretical Computer Science
Volume	201
Issue number	C
DOIs	https://doi.org/10.1016/j.entcs.2008.02.020
Publication status	Published - 7 Mar 2008

Keywords

action systems
data refinement
Kleene algebra
probability
refinement algebra

Access to Document

10.1016/j.entcs.2008.02.020

Cite this

@article{c0516738e8974a01bf359553dc640449,

title = "Refinement Algebra for Probabilistic Programs",

abstract = "We propose an abstract refinement algebra for reasoning about probabilistic programs in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled, has certain failure or does not have certain failure, respectively. As an application, refinement rules for probabilistic action systems are derived in the algebra.",

keywords = "action systems, data refinement, Kleene algebra, probability, refinement algebra",

author = "Larissa Meinicke and Kim Solin",

year = "2008",

month = mar,

day = "7",

doi = "10.1016/j.entcs.2008.02.020",

language = "English",

volume = "201",

pages = "177--195",

journal = "Electronic Notes in Theoretical Computer Science",

issn = "1571-0661",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - Refinement Algebra for Probabilistic Programs

AU - Meinicke, Larissa

AU - Solin, Kim

PY - 2008/3/7

Y1 - 2008/3/7

N2 - We propose an abstract refinement algebra for reasoning about probabilistic programs in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled, has certain failure or does not have certain failure, respectively. As an application, refinement rules for probabilistic action systems are derived in the algebra.

AB - We propose an abstract refinement algebra for reasoning about probabilistic programs in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled, has certain failure or does not have certain failure, respectively. As an application, refinement rules for probabilistic action systems are derived in the algebra.

KW - action systems

KW - data refinement

KW - Kleene algebra

KW - probability

KW - refinement algebra

UR - https://www.scopus.com/pages/publications/40149099146

U2 - 10.1016/j.entcs.2008.02.020

DO - 10.1016/j.entcs.2008.02.020

M3 - Article

AN - SCOPUS:40149099146

SN - 1571-0661

VL - 201

SP - 177

EP - 195

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

IS - C

ER -

Refinement Algebra for Probabilistic Programs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this