Pages that link to "Item:Q2233477"

The following pages link to Automated termination analysis of polynomial probabilistic programs (Q2233477):

Displaying 9 items.

• Learning probabilistic termination proofs (Q832245) (← links)
• Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
• Moment-based analysis of Bayesian network properties (Q2072070) (← links)
• Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
• The probabilistic termination tool amber (Q6145021) (← links)
• Probabilistic program verification via inductive synthesis of inductive invariants (Q6536145) (← links)
• On lexicographic proof rules for probabilistic termination (Q6610383) (← links)
• From innermost to full almost-sure termination of probabilistic term rewriting (Q6629527) (← links)
• Exact and approximate moment derivation for probabilistic loops with non-polynomial assignments (Q6639407) (← links)