A denotational semantics for low-level probabilistic programs with nondeterminism
From MaRDI portal
Publication:2133180
DOI10.1016/j.entcs.2019.09.016OpenAlexW2995312724WikidataQ113317347 ScholiaQ113317347MaRDI QIDQ2133180
Publication date: 29 April 2022
Full work available at URL: https://doi.org/10.1016/j.entcs.2019.09.016
Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
Continualization of Probabilistic Programs With Correction ⋮ Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantic domains for combining probability and non-determinism
- Runtime analysis of probabilistic programs with unbounded recursion
- A probabilistic PDL
- Semantics of probabilistic programs
- Topology, domain theory and theoretical computer science
- PCF extended with real numbers
- Directed hypergraphs and applications
- Uncertainty propagation using probabilistic affine forms and concentration of measure inequalities
- Fine-grained semantics for probabilistic programs
- How long, O Bayesian network, will I sample thee? A program analysis perspective on expected sampling times
- Recursive Markov Decision Processes and Recursive Stochastic Games
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
- Probabilistic Termination
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- Probabilistic Abstract Interpretation
- Probabilistic relational reasoning for differential privacy
- A lambda-calculus foundation for universal probabilistic programming
- Commutative Semantics for Probabilistic Programming
- Precise interprocedural analysis through linear algebra
- Abstraction Refinement for Probabilistic Software
- A Unified Approach to Path Problems
- Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
- Semantics for probabilistic programming
- Reasoning about Recursive Probabilistic Programs
- Abstraction, Refinement and Proof for Probabilistic Systems
- Programming as a Discipline of Mathematical Nature
- Linear-Invariant Generation for Probabilistic Programs:
- A Convenient Category for Higher-Order Probability Theory
- Formal certification of code-based cryptographic proofs
- Stochastic invariants for probabilistic termination
- Cantor meets Scott: semantic foundations for probabilistic networks
- Interprocedural Analysis of Concurrent Programs Under a Context Bound
- STACS 2005
- Partial correctness for probabilistic demonic programs
- Conditioning in probabilistic programming
This page was built for publication: A denotational semantics for low-level probabilistic programs with nondeterminism
