Understanding Probabilistic Programs

DOI10.1007/978-3-319-23506-6_4zbMath1444.68045OpenAlexW2296309018WikidataQ57800754 ScholiaQ57800754MaRDI QIDQ3449623

Federico Olmedo, Friedrich Gretz, Benjamin Lucien Kaminski, Nils Jansen, Joost-Pieter Katoen

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10089698/

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)

Related Items

Model checking finite-horizon Markov chains with probabilistic inference ⋮ A debugger for probabilistic programs ⋮ Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ Maximizing the Conditional Expected Reward for Reaching the Goal ⋮ Fifty years of Hoare's logic ⋮ Identity-Based Cryptosystems and Quadratic Residuosity ⋮ Nearly Optimal Verifiable Data Streaming ⋮ Disintegration and Bayesian inversion via string diagrams

Uses Software

• pGCL
• Figaro

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantics of probabilistic programs
• Probabilistic guarded commands mechanized in HOL
• Probabilistic relational reasoning for differential privacy
• On the Hardness of Almost–Sure Termination
• Verification of Probabilistic Programs
• Abstraction, Refinement and Proof for Probabilistic Systems
• Linear-Invariant Generation for Probabilistic Programs:
• Tabular
• Conditioning in probabilistic programming