• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Refinement Algebra for Probabilistic Programs

Larissa Meinicke, Kim Solin, Refinement Algebra for Probabilistic Programs. In: Electronic Notes in Theoretical Computer Science, Proceedings of the BCS-FACS Refinement Workshop (REFINE 2007) , 201, 177-195 , Elsevier, 2008.

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.

BibTeX entry:

@INPROCEEDINGS{inpMeSo07a,
  title = {Refinement Algebra for Probabilistic Programs},
  booktitle = {Electronic Notes in Theoretical Computer Science, Proceedings of the BCS-FACS Refinement Workshop (REFINE 2007) },
  author = {Meinicke, Larissa and Solin, Kim},
  volume = {201},
  publisher = {Elsevier},
  pages = {177-195 },
  year = {2008},
  keywords = {refinement algebra, probability, Kleene algebra, action systems, data refinement},
}

Belongs to TUCS Research Unit(s): Distributed Systems Laboratory (DS Lab), Software Construction Laboratorium

Edit publication