Refinement algebra for probabilistic programs
From MaRDI portal
Publication:2268474
DOI10.1007/S00165-009-0111-1zbMath1183.68198OpenAlexW2084581205MaRDI QIDQ2268474
Kim Solin, Larissa A. Meinicke
Publication date: 8 March 2010
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-009-0111-1
Related Items (5)
Unifying Theories of Programming with Monads ⋮ Reactive Probabilistic Programs and Refinement Algebra ⋮ Integrating stochastic reasoning into Event-B development ⋮ Normal forms in total correctness for while programs and action systems ⋮ Algebra of Monotonic Boolean Transformers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic reasoning for probabilistic action systems and while-loops
- Reasoning algebraically about loops
- A completeness theorem for Kleene algebras and the algebra of regular events
- Towards a refinement algebra
- Reactive Probabilistic Programs and Refinement Algebra
- Probabilistic Choice in Refinement Algebra
- Refinement Algebra with Operators for Enabledness and Termination
- Reduction
- Refinement Calculus
- Abstraction, Refinement and Proof for Probabilistic Systems
- Towards Automated Proof Support for Probabilistic Distributed Systems
- Using Probabilistic Kleene Algebra for Protocol Verification
- On Two Dually Nondeterministic Refinement Algebras
- Monodic Tree Kleene Algebra
This page was built for publication: Refinement algebra for probabilistic programs
