Pages that link to "Item:Q4633526"
From MaRDI portal
The following pages link to Synthesizing Probabilistic Invariants via Doob’s Decomposition (Q4633526):
Displaying 12 items.
- Latticed \(k\)-induction with an application to probabilistic programs (Q832288) (← links)
- Moment-based analysis of Bayesian network properties (Q2072070) (← links)
- Probabilistic Lipschitz analysis of neural networks (Q2233541) (← links)
- Quantitative static analysis of communication protocols using abstract Markov chains (Q2322314) (← links)
- Nearly Optimal Verifiable Data Streaming (Q2798786) (← links)
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops (Q3297595) (← links)
- Maximizing the Conditional Expected Reward for Reaching the Goal (Q3303934) (← links)
- Moment-based invariants for probabilistic loops with non-polynomial assignments (Q6103023) (← links)
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs (Q6487312) (← links)
- On Lexicographic Proof Rules for Probabilistic Termination (Q6488476) (← links)
- Probabilistic program verification via inductive synthesis of inductive invariants (Q6536145) (← links)
- On lexicographic proof rules for probabilistic termination (Q6610383) (← links)