Refinement algebra for probabilistic programs

DOI10.1007/S00165-009-0111-1zbMATH Open1183.68198OpenAlexW2084581205MaRDI QIDQ2268474FDOQ2268474

Authors 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

zbMATH Keywords

probabilityKleene algebradata refinementaction systemsrefinement algebraatomicity refinement

Mathematics Subject Classification ID

Theory of software (68N99)

Recommendations

• Reactive Probabilistic Programs and Refinement Algebra
• Probabilistic Choice in Refinement Algebra
• CONCUR 2005 – Concurrency Theory
• scientific article; zbMATH DE number 3890702
• Fine-grained semantics for probabilistic programs
• Probabilistic  -calculus and Quantitative Program Analysis
• A generalisation of stationary distributions, and probabilistic program algebra
• Reasoning about Recursive Probabilistic Programs
• Abstraction Refinement for Probabilistic Software

Cites work

• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 1086671 (Why is no real title available?)
• scientific article; zbMATH DE number 194642 (Why is no real title available?)
• scientific article; zbMATH DE number 194916 (Why is no real title available?)
• scientific article; zbMATH DE number 2090029 (Why is no real title available?)
• A completeness theorem for Kleene algebras and the algebra of regular events
• Abstraction, Refinement and Proof for Probabilistic Systems
• Algebraic reasoning for probabilistic action systems and while-loops
• Almost-certain eventualities and abstract probabilities in the temporal logic PTL
• Monodic Tree Kleene Algebra
• On Two Dually Nondeterministic Refinement Algebras
• Probabilistic Choice in Refinement Algebra
• Reactive Probabilistic Programs and Refinement Algebra
• Reasoning algebraically about loops
• Reduction
• Refinement Algebra with Operators for Enabledness and Termination
• Refinement Calculus
• Towards Automated Proof Support for Probabilistic Distributed Systems
• Towards a refinement algebra
• Using Probabilistic Kleene Algebra for Protocol Verification

Cited in

(17)

• A generalisation of stationary distributions, and probabilistic program algebra
• Normal forms in total correctness for while programs and action systems
• Invariants and well-foundedness in program algebra
• Integrating stochastic reasoning into Event-B development
• ZB 2005: Formal Specification and Development in Z and B
• Unifying theories of programming with monads
• Refinement Algebra with Operators for Enabledness and Termination
• Linking theories of probabilistic programming
• Reasoning about probabilistic sequential programs in a probabilistic logic
• On Two Dually Nondeterministic Refinement Algebras
• An algebraic treatment of procedure refinement to support mechanical verification
• Reactive Probabilistic Programs and Refinement Algebra
• Algebraic reasoning for probabilistic action systems and while-loops
• CONCUR 2005 – Concurrency Theory
• Towards a linear algebra of programming
• Probabilistic Choice in Refinement Algebra
• Algebra of monotonic Boolean transformers

This page was built for publication: Refinement algebra for probabilistic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268474)