David Parker
Abstract
“ProPPA: Probabilistic Programming for Stochastic Dynamical Systems,” by Georgoulas, Hillston, and Sanguinetti, introduces the ProPPA formalism, which brings together ideas from stochastic process algebras with those from the paradigm of probabilistic programming. The article formally defines the ProPPA language and its semantics and presents a tool-set, along with results from illustrative examples. This replicated computational results report installs and runs the tool-set and repeats the simulation-based results from the article, finding that the published results are repeatable.
- Georgoulas Anastasisa, Jane Hillston, and Guido Sanguinetti. 2017. ProPPA: Probabilistic programming for stochastic dynamical systems. Trans. Model. Comput. Simul. (2017). To appear. Google Scholar
Digital Library
Index Terms
- Replicated Computational Results (RCR) Report for “ProPPA: Probabilistic Programming for Stochastic Dynamical Systems”
Recommendations
ProPPA: Probabilistic Programming for Stochastic Dynamical Systems
Formal languages like process algebras have been shown to be effective tools in modelling a wide range of dynamic systems, providing a high-level description that is readily transformed into an executable model. However, their application is sometimes ...
Conditioning in Probabilistic Programming
In this paper, we investigate the semantic intricacies of conditioning in probabilistic programming, a major feature, e.g., in machine learning. We provide a quantitative weakest pre-condition semantics. In contrast to all other approaches, non-...
A lambda-calculus foundation for universal probabilistic programming
ICFP 2016: Proceedings of the 21st ACM SIGPLAN International Conference on Functional ProgrammingWe develop the operational semantics of an untyped probabilistic λ-calculus with continuous distributions, and both hard and soft constraints,as a foundation for universal probabilistic programming languages such as Church, Anglican, and Venture. Our ...
Comments