Generating functions for probabilistic programs

DOI10.1007/978-3-030-68446-4_12OpenAlexW3135402417MaRDI QIDQ2119118

Lutz Klinkenberg, Kevin Batz, Tobias Winkler, Benjamin Lucien Kaminski, Joshua Moerman, Joost-Pieter Katoen

Publication date: 23 March 2022

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

zbMATH Keywords

semanticsformal power seriesquantitative verificationprobabilistic programs

Mathematics Subject Classification ID

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

Uses Software

• SymPy
• EfProb

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed point theorems and semantics: A folk tale
• On the hardness of analyzing probabilistic programs
• Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy
• Uncertainty propagation using probabilistic affine forms and concentration of measure inequalities
• Computing expected runtimes for constant probability programs
• Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
• Probabilistic Abstract Interpretation
• Semantics of Probabilistic Programs: A Weak Limit Approach
• VERIFYING PROBABILISTIC PROGRAMS USING A HOARE LIKE LOGIC
• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• Analysis of Probabilistic Systems via Generating Functions and Padé Approximation
• The EfProb Library for Probabilistic Calculations
• Abstraction, Refinement and Proof for Probabilistic Systems
• Coupling proofs are probabilistic product programs

This page was built for publication: Generating functions for probabilistic programs