Pages that link to "Item:Q2819834"

The following pages link to Probabilistic termination: soundness, completeness, and compositionality (Q2819834):

Displaying 33 items.

• Toward automatic verification of quantum programs (Q667515) (← links)
• Learning probabilistic termination proofs (Q832245) (← links)
• Confluence and convergence modulo equivalence in probabilistically terminating reduction systems (Q1726351) (← links)
• On the hardness of analyzing probabilistic programs (Q1733103) (← links)
• On randomised strategies in the \(\lambda \)-calculus (Q1989325) (← links)
• Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
• Moment-based analysis of Bayesian network properties (Q2072070) (← links)
• A denotational semantics for low-level probabilistic programs with nondeterminism (Q2133180) (← links)
• Soundness and completeness results for LEA and probability semantics (Q2151410) (← links)
• Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
• Automated termination analysis of polynomial probabilistic programs (Q2233477) (← links)
• Syntactic partial order compression for probabilistic reachability (Q2287108) (← links)
• Computing expected runtimes for constant probability programs (Q2305420) (← links)
• Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs (Q2802489) (← links)
• On the Hardness of Almost–Sure Termination (Q2946345) (← links)
• On Higher-Order Probabilistic Subrecursion (Q2988381) (← links)
• Probabilistic Termination by Monadic Affine Sized Typing (Q2988649) (← links)
• Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
• (Q3806793) (← links)
• (Q5002798) (← links)
• (Q5028447) (← links)
• (Q5089021) (← links)
• Probabilistic Analysis of Binary Sessions (Q5089279) (← links)
• (Q5094133) (← links)
• (Q5129945) (← links)
• Stochastic invariants for probabilistic termination (Q5370852) (← links)
• The probabilistic termination tool amber (Q6145021) (← 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)
• From innermost to full almost-sure termination of probabilistic term rewriting (Q6629527) (← links)
• Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: semantics and automated reasoning with theorem proving (Q6639734) (← links)