uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Refinement Algebra for Probabilistic Programs
Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Arts, Department of Philosophy.
2010 (English)In: Formal Aspects of Computing, ISSN 0934-5043, E-ISSN 1433-299X, Vol. 22, no 1, 3-31 p.Article in journal (Refereed) Published
Abstract [en]

We identify a refinement algebra for reasoning about probabilistic program transformations in a total-correctness setting. The algebra is equipped with operators that determine whether a program is enabled or terminates respectively. As well as developing the basic theory of the algebra we demonstrate how it may be used to explain key differences and similarities between standard (i.e. non-probabilistic) and probabilistic programs and verify important transformation theorems for probabilistic action systems.

Place, publisher, year, edition, pages
London: Springer International , 2010. Vol. 22, no 1, 3-31 p.
National Category
URN: urn:nbn:se:uu:diva-119862DOI: 10.1007/s00165-009-0111-1ISI: 000273979400002OAI: oai:DiVA.org:uu-119862DiVA: diva2:301075
Available from: 2010-03-02 Created: 2010-03-02 Last updated: 2013-12-30

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://www.springerlink.com/content/17470421p43458h4/fulltext.pdf

Search in DiVA

By author/editor
Solin, Kim
By organisation
Department of Philosophy
In the same journal
Formal Aspects of Computing

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 159 hits
ReferencesLink to record
Permanent link

Direct link