Fine-grained semantics for probabilistic programs
From MaRDI portal
Publication:2323972
DOI10.1007/978-3-319-89884-1_6zbMATH Open1418.68051OpenAlexW2797207385MaRDI QIDQ2323972FDOQ2323972
Martin Vechev, Benjamin Bichsel, Timon Gehr
Publication date: 13 September 2019
Full work available at URL: https://doi.org/10.1007/978-3-319-89884-1_6
Recommendations
- Semantics of the probabilistic typed lambda calculus. Markov chain semantics, termination behavior, and denotational semantics
- Probabilistic programming: a true verification challenge
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- scientific article; zbMATH DE number 1104373
- Understanding probabilistic programs
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)
Cited In (14)
- Reasoning about Recursive Probabilistic Programs
- PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control
- Probabilistic programming inference via intensional semantics
- Formalising Semantics for Expected Running Time of Probabilistic Programs
- Reasoning about probabilistic sequential programs
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Modelling contextuality by probabilistic programs with hypergraph semantics
- Program equivalence in a typed probabilistic call-by-need functional language
- Title not available (Why is that?)
- Refinement algebra for probabilistic programs
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Title not available (Why is that?)
- Title not available (Why is that?)
- Continualization of Probabilistic Programs With Correction
This page was built for publication: Fine-grained semantics for probabilistic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2323972)
