A denotational semantics for low-level probabilistic programs with nondeterminism
From MaRDI portal
Publication:2133180
Recommendations
- Fine-grained semantics for probabilistic programs
- Semantics of probabilistic programs: a weak limit approach
- Application ofComputable Distributions to the Semantics of Probabilistic Programs
- Probabilistic semantics and program analysis
- Semantics of Probabilistic Programming: A Gentle Introduction
- Probabilistic semantics of terminating programs
- scientific article; zbMATH DE number 4076588
- An application of computable distributions to the semantics of probabilistic programming languages
- scientific article; zbMATH DE number 3890702
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
Cites work
- A Convenient Category for Higher-Order Probability Theory
- A lambda-calculus foundation for universal probabilistic programming
- A probabilistic PDL
- A Unified Approach to Path Problems
- Abstraction Refinement for Probabilistic Software
- Abstraction, Refinement and Proof for Probabilistic Systems
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- Axioms for probability and nondeterminism
- Cantor meets Scott: semantic foundations for probabilistic networks
- Commutative semantics for probabilistic programming
- Conditioning in probabilistic programming
- Directed hypergraphs and applications
- Fine-grained semantics for probabilistic programs
- Formal certification of code-based cryptographic proofs
- How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times
- scientific article; zbMATH DE number 1617330 (Why is no real title available?)
- scientific article; zbMATH DE number 4179422 (Why is no real title available?)
- scientific article; zbMATH DE number 3128787 (Why is no real title available?)
- scientific article; zbMATH DE number 3726420 (Why is no real title available?)
- scientific article; zbMATH DE number 3779293 (Why is no real title available?)
- scientific article; zbMATH DE number 1231645 (Why is no real title available?)
- scientific article; zbMATH DE number 1324656 (Why is no real title available?)
- scientific article; zbMATH DE number 1759622 (Why is no real title available?)
- scientific article; zbMATH DE number 2090849 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- Linear-invariant generation for probabilistic programs: automated support for proof-based methods
- Partial correctness for probabilistic demonic programs
- PCF extended with real numbers
- Precise interprocedural analysis through linear algebra
- Probabilistic abstract interpretation
- Probabilistic relational reasoning for differential privacy
- Probabilistic termination: soundness, completeness, and compositionality
- Programming as a Discipline of Mathematical Nature
- Reasoning about Recursive Probabilistic Programs
- Recursive Markov decision processes and recursive stochastic games
- Runtime analysis of probabilistic programs with unbounded recursion
- Semantic domains for combining probability and non-determinism
- Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
- Semantics of probabilistic programs
- STACS 2005
- Stochastic invariants for probabilistic termination
- Termination analysis of probabilistic programs through Positivstellensatz's
- Topology, domain theory and theoretical computer science
- Uncertainty propagation using probabilistic affine forms and concentration of measure inequalities
- Weakest precondition reasoning for expected run-times of probabilistic programs
Cited in
(5)- A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language
- scientific article; zbMATH DE number 1324657 (Why is no real title available?)
- Continualization of probabilistic programs with correction
- Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism
- Multisets and distributions
This page was built for publication: A denotational semantics for low-level probabilistic programs with nondeterminism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133180)
