Refinement Algebra for Probabilistic Programs

Larissa Meinicke, Kim Solin

Research output: Contribution to journalArticleResearchpeer-review

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.

LanguageEnglish
Pages177-195
Number of pages19
JournalElectronic Notes in Theoretical Computer Science
Volume201
Issue numberC
DOIs
Publication statusPublished - 7 Mar 2008

Fingerprint

Algebra
Refinement
Mathematical operators
Correctness
Reasoning
Operator

Keywords

  • action systems
  • data refinement
  • Kleene algebra
  • probability
  • refinement algebra

Cite this

Meinicke, Larissa ; Solin, Kim. / Refinement Algebra for Probabilistic Programs. In: Electronic Notes in Theoretical Computer Science. 2008 ; Vol. 201, No. C. pp. 177-195.
@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 = "3",
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",

}

Refinement Algebra for Probabilistic Programs. / Meinicke, Larissa; Solin, Kim.

In: Electronic Notes in Theoretical Computer Science, Vol. 201, No. C, 07.03.2008, p. 177-195.

Research output: Contribution to journalArticleResearchpeer-review

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 - http://www.scopus.com/inward/record.url?scp=40149099146&partnerID=8YFLogxK

U2 - 10.1016/j.entcs.2008.02.020

DO - 10.1016/j.entcs.2008.02.020

M3 - Article

VL - 201

SP - 177

EP - 195

JO - Electronic Notes in Theoretical Computer Science

T2 - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

IS - C

ER -