How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times

DOI10.1007/978-3-319-89884-1_7zbMath1418.68050arXiv1802.10433OpenAlexW2797914422MaRDI QIDQ2323973

Kevin Batz, Benjamin Lucien Kaminski, Christoph Matheja, Joost-Pieter Katoen

Publication date: 13 September 2019

Full work available at URL: https://arxiv.org/abs/1802.10433

zbMATH Keywords

program verificationweakest preconditionsprobabilistic programsexpected runtimes

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

Learning probabilistic termination proofs ⋮ Model checking finite-horizon Markov chains with probabilistic inference ⋮ A denotational semantics for low-level probabilistic programs with nondeterminism ⋮ Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops ⋮ Automatic Analysis of Expected Termination Time for Population Protocols ⋮ Moment-based analysis of Bayesian network properties

This page was built for publication: How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times