Pages that link to "Item:Q1159979"
From MaRDI portal
The following pages link to Semantics of probabilistic programs (Q1159979):
Displayed 50 items.
- The expectation monad in quantum foundations (Q320204) (← links)
- Probabilistic rely-guarantee calculus (Q507375) (← links)
- A probability perspective (Q640292) (← links)
- The probabilistic powerdomain for stably compact spaces (Q703479) (← links)
- A probabilistic dynamic logic (Q792757) (← links)
- Decidability of finite probabilistic propositional dynamic logics (Q809069) (← links)
- Learning probabilistic termination proofs (Q832245) (← links)
- Model checking finite-horizon Markov chains with probabilistic inference (Q832295) (← links)
- Rigorous roundoff error analysis of probabilistic floating-point computations (Q832297) (← links)
- Generic weakest precondition semantics from monads enriched with order (Q890376) (← links)
- Proofs of randomized algorithms in Coq (Q923886) (← links)
- A computable approach to measure and integration theory (Q1021572) (← links)
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis (Q1044673) (← links)
- A probabilistic PDL (Q1063584) (← links)
- Continuity spaces: Reconciling domains and metric spaces (Q1391864) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- Measure and probability for concurrency theorists (Q1589655) (← links)
- From probability monads to commutative effectuses (Q1683710) (← links)
- Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
- On the hardness of analyzing probabilistic programs (Q1733103) (← links)
- The converse of a stochastic relation (Q1764800) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Moment-based analysis of Bayesian network properties (Q2072070) (← links)
- Formal semantics of a classical-quantum language (Q2123052) (← links)
- A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
- Hennessy-Milner results for probabilistic PDL (Q2133481) (← links)
- Borel kernels and their approximation, categorically (Q2134827) (← links)
- Correctness of sequential Monte Carlo inference for probabilistic programming languages (Q2233471) (← links)
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere (Q2233472) (← links)
- Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
- Confluence in probabilistic rewriting (Q2333318) (← links)
- The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator (Q2372202) (← links)
- Reasoning about probabilistic sequential programs (Q2373709) (← links)
- Commutativity of quantum weakest preconditions (Q2380014) (← links)
- Bisimulation for labelled Markov processes (Q2506488) (← links)
- On finite-state approximants for probabilistic computation tree logic (Q2576951) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages (Q2802487) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Categories of Timed Stochastic Relations (Q2805158) (← links)
- A Theory of Slicing for Probabilistic Control Flow Graphs (Q2811339) (← links)
- Labelled Markov Processes as Generalised Stochastic Relations (Q2864159) (← links)
- On Probabilistic Techniques for Data Flow Analysis (Q2870284) (← links)
- Semantics of Probabilistic Programs: A Weak Limit Approach (Q2937792) (← links)
- On the Hardness of Almost–Sure Termination (Q2946345) (← links)
- On Higher-Order Probabilistic Subrecursion (Q2988381) (← links)
- Commutative Semantics for Probabilistic Programming (Q2988671) (← links)
- Understanding Probabilistic Programs (Q3449623) (← links)
- Unifying Theories of Programming with Monads (Q3455643) (← links)
- Probabilistic Analysis of Programs: A Weak Limit Approach (Q3460504) (← links)