Cites work
- A Fast Monte-Carlo Test for Primality
- A Powerdomain Construction
- Einige abstrakte Begriffe in der numerischen Mathematik (Anwendungen der Halbordnung).(Some abstract notions in the numerical mathematic. (Applications et semiorder))
- Expected time bounds for selection
- Formal models for some features of programming languages
- scientific article; zbMATH DE number 3137662 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3557236 (Why is no real title available?)
- scientific article; zbMATH DE number 3569835 (Why is no real title available?)
- scientific article; zbMATH DE number 3597592 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3256930 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- scientific article; zbMATH DE number 3060775 (Why is no real title available?)
Cited in
(only showing first 100 items - show all)- A computable approach to measure and integration theory
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- A probabilistic PDL
- Continuity spaces: Reconciling domains and metric spaces
- Approximating labelled Markov processes
- Measure and probability for concurrency theorists
- From probability monads to commutative effectuses
- Approximate counting in SMT and value estimation for probabilistic programs
- On the hardness of analyzing probabilistic programs
- The converse of a stochastic relation
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Moment-based analysis of Bayesian network properties
- Formal semantics of a classical-quantum language
- A denotational semantics for low-level probabilistic programs with nondeterminism
- Hennessy-Milner results for probabilistic PDL
- Borel kernels and their approximation, categorically
- Correctness of sequential Monte Carlo inference for probabilistic programming languages
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere
- Automated termination analysis of polynomial probabilistic programs
- Confluence in probabilistic rewriting
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator
- Reasoning about probabilistic sequential programs
- Commutativity of quantum weakest preconditions
- Bisimulation for labelled Markov processes
- On finite-state approximants for probabilistic computation tree logic
- Probabilistic NetKAT
- An application of computable distributions to the semantics of probabilistic programming languages
- Weakest precondition reasoning for expected run-times of probabilistic programs
- Categories of timed stochastic relations
- A theory of slicing for probabilistic control flow graphs
- Labelled Markov processes as generalised stochastic relations
- On probabilistic techniques for data flow analysis
- Semantics of probabilistic programs: a weak limit approach
- On the hardness of almost-sure termination
- On higher-order probabilistic subrecursion
- Commutative semantics for probabilistic programming
- The expectation monad in quantum foundations
- Understanding probabilistic programs
- Unifying theories of programming with monads
- Probabilistic analysis of programs: a weak limit approach
- Computable exchangeable sequences have computable de Finetti measures
- Dynamic logic with program specifications and its relational proof system
- A type theory for probabilistic and Bayesian reasoning
- Characterizations of semantic domains for randomized algorithms
- A generalisation of stationary distributions, and probabilistic program algebra
- Linear Structures for Concurrency in Probabilistic Programming Languages
- scientific article; zbMATH DE number 7376040 (Why is no real title available?)
- The beta-Bernoulli process and algebraic effects
- On higher-order probabilistic subrecursion
- Continualization of probabilistic programs with correction
- Probabilistic rely-guarantee calculus
- Proof theory of Riesz spaces and modal Riesz spaces
- Stochastic differential dynamic logic for stochastic hybrid programs
- Probabilistic logics based on Riesz spaces
- Probabilistic abstract interpretation of imperative programs using truncated normal distributions
- Probabilistic logic over paths
- Quantification of integrity
- Measure transformer semantics for Bayesian machine learning
- Partial correctness for probabilistic demonic programs
- Conditioning in probabilistic programming
- Reversible monadic computing
- An effect-theoretic account of Lebesgue integration
- Healthiness conditions for predicate transformers
- VPHL: a verified partial-correctness logic for probabilistic programs
- Control-data separation and logical condition propagation for efficient inference on probabilistic programs
- The syntactic side of autonomous categories enriched over generalised metric spaces
- Mixed nondeterministic-probabilistic automata: blending graphical probabilistic models with nondeterminism
- A probability perspective
- Data-Driven Invariant Learning for Probabilistic Programs
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
- Does a Program Yield the Right Distribution?
- Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
- On Lexicographic Proof Rules for Probabilistic Termination
- Automatic alignment in higher-order probabilistic programming languages
- Generative Datalog with continuous distributions
- Towards logical foundations for probabilistic computation
- On lexicographic proof rules for probabilistic termination
- Multisets and distributions, in drawing and learning
- Structure in machine learning
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving
- Curry and Howard meet Borel
- Propositional logics for the Lawvere quantale
- A partial metric semantics of higher-order types and approximate program transformations
- Weighted automata for exact inference in discrete probabilistic programs
- The complexity of verifying loop-free programs as differentially private
- On iteration in discrete probabilistic programming
- Two-sorted algebraic decompositions of Brookes's shared-state denotational semantics
- Data-driven invariant learning for probabilistic programs
- Quantitative verification with neural networks
- An interval-based abstraction for quantifying information flow
- Probabilistic output analysis by program manipulation
- Integration in cones
- The probabilistic powerdomain for stably compact spaces
- Quantitative verification with neural networks
- Equivalence and conditional independence in atomic sheaf logic
- Safety, relative tightness and the probabilistic frame rule
- Double glueing over free exponential: with measure theoretic applications
- A probabilistic dynamic logic
- Decidability of finite probabilistic propositional dynamic logics
- Learning probabilistic termination proofs
This page was built for publication: Semantics of probabilistic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159979)
