Pages that link to "Item:Q1733103"
From MaRDI portal
The following pages link to On the hardness of analyzing probabilistic programs (Q1733103):
Displaying 19 items.
- Learning probabilistic termination proofs (Q832245) (← links)
- Latticed \(k\)-induction with an application to probabilistic programs (Q832288) (← links)
- Inferring covariances for probabilistic programs (Q1693100) (← links)
- Probabilistic termination versus fair termination (Q1822937) (← links)
- Generating functions for probabilistic programs (Q2119118) (← links)
- Densities of almost surely terminating probabilistic programs are differentiable almost everywhere (Q2233472) (← links)
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (Q2828275) (← links)
- On probabilistic techniques for data flow analysis (Q2870284) (← links)
- On the Hardness of Almost–Sure Termination (Q2946345) (← links)
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops (Q3297595) (← links)
- Deciding Fast Termination for Probabilistic VASS with Nondeterminism (Q3297606) (← links)
- Analysis-aware defeaturing: Problem setting and <i>a posteriori</i> estimation (Q5068834) (← links)
- Program analysis is harder than verification: a computability perspective (Q6039396) (← links)
- Symbolic computation in automated program reasoning (Q6174522) (← links)
- Probabilistic program verification via inductive synthesis of inductive invariants (Q6536145) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
- Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving (Q6639734) (← links)
- Probabilistic verification beyond context-freeness (Q6649464) (← links)
