Reactive Probabilistic Programs and Refinement Algebra
From MaRDI portal
Publication:3498423
DOI10.1007/978-3-540-78913-0_23zbMath1138.68360MaRDI QIDQ3498423
Kim Solin, Larissa A. Meinicke
Publication date: 15 May 2008
Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78913-0_23
68Q55: Semantics in the theory of computing
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Abstract representation theorems for demonic refinement algebras, Enabledness and termination in refinement algebra, Refinement algebra for probabilistic programs, Probabilistic Choice in Refinement Algebra
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic notions of nontermination: Omega and divergence in idempotent semirings
- Towards a refinement algebra
- Refinement algebra for probabilistic programs
- Algebraic Notions of Termination
- Refinement Algebra with Operators for Enabledness and Termination
- Mathematics of Program Construction
- Using Probabilistic Kleene Algebra for Protocol Verification
- On Two Dually Nondeterministic Refinement Algebras
- Monodic Tree Kleene Algebra
- A sequential real-time refinement calculus