Linking theories in probabilistic programming

DOI10.1016/S0020-0255(99)00015-8zbMath0943.68033OpenAlexW2117546271MaRDI QIDQ1961866

Jifeng He, C. A. R. Hoare

Publication date: 30 January 2000

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0255(99)00015-8

zbMATH Keywords

relational calculusprobabilistic programming

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Theoretical and practical approaches to the denotational semantics for MDESL based on UTP

Cites Work

• A theoretical basis for stepwise refinement and the programming calculus
• A calculus of refinements for program derivations
• Bisimulation through probabilistic testing
• Probabilistic models for the guarded command language
• A logic for reasoning about probabilities
• Axiomatizing probabilistic processes: ACP with generative probabilities
• Refinement-oriented probability for CSP
• Laws of programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linking theories in probabilistic programming