No article text was recorded for this version.
quantitative termination analysis
Version 1 of 1110 papers265 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
- Blog: On Lexicographic Proof Rules for Probabilistic Termination
- Blog: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- Blog: Conditioning in Probabilistic Programming
- Blog: New Approaches for Almost-Sure Termination of Probabilistic Programs
- Blog: Lexicographic Ranking Supermartingales with Lazy Lower Bounds
- Blog: Compositional Analysis for Almost-Sure Termination of Probabilistic Programs
- Blog: Modular verification for almost-sure termination of probabilistic programs
- Blog: On Lexicographic Proof Rules for Probabilistic Termination
- Blog: Quantitative Analysis of Assertion Violations in Probabilistic Programs
- Blog: Lower Bounds for Possibly Divergent Probabilistic Programs
- Blog: Sound and Complete Proof Rules for Probabilistic Termination
- Blog: Termination of Nondeterministic Recursive Probabilistic Programs
- Blog: The probabilistic termination tool amber
- Blog: Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs
- Blog: On Lexicographic Proof Rules for Probabilistic Termination
- Blog: On Probabilistic Termination of Functional Programs with Continuous Distributions
- Blog: Lexicographic Ranking Supermartingales with Lazy Lower Bounds
- Blog: Automated Termination Analysis of Polynomial Probabilistic Programs
- Blog: Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
- Blog: Automated Termination Analysis of Polynomial Probabilistic Programs
- Blog: Quantitative Bounds on Resource Usage of Probabilistic Programs
- Blog: The Probabilistic Termination Tool Amber
- Blog: Proving Almost-Sure Termination of Probabilistic Programs via\n Incremental Pruning
- Blog: Supermartingales, Ranking Functions and Probabilistic Lambda Calculus
- Blog: Positive Almost-Sure Termination: Complexity and Proof Rules
- Blog: Stochastic Invariants for Probabilistic Termination
- Blog: Supermartingales, Ranking Functions and Probabilistic Lambda Calculus
- Blog: Expected-Cost Analysis for Probabilistic Programs and Semantics-Level Adaption of Optional Stopping Theorems
- Blog: On Lexicographic Proof Rules for Probabilistic Termination
- Blog: Nonparametric Involutive Markov Chain Monte Carlo
- Blog: Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving
- Blog: Termination Analysis of Probabilistic Programs through Positivstellensatz's
- Blog: The complexity of reachability in parametric Markov decision processes
- Blog: A Probabilistic Higher-order Fixpoint Logic
- Blog: Refuting Equivalence in Probabilistic Programs with Conditioning
- Blog: Polynomial Probabilistic Invariants and the Optional Stopping Theorem
- Blog: Proving Almost-Sure Termination of Probabilistic Programs via Incremental Pruning
- Blog: Nonparametric Involutive Markov Chain Monte Carlo
- Blog: On the Termination Problem for Probabilistic Higher-Order Recursive Programs
- Blog: DynamiTe: Dynamic Termination and Non-termination Proofs
- Blog: Two-way affine automata can verify every language
- Blog: Symbolic Computation of Maximal Probabilistic Reachability
- Blog: Refuting Equivalence in Probabilistic Programs with Conditioning
- Blog: Quantum programming: From theories to implementations
- Blog: Positive Almost-Sure Termination - Complexity and Proof Rules
- Blog: Piecewise Analysis of Probabilistic Programs via 𝑘-Induction
- Blog: Fairness in Ranking Supermartingales
- Blog: Termination of nondeterministic quantum programs
- Blog: Proving Non-termination by Program Reversal
- Blog: Generative Datalog with Continuous Distributions
- Blog: A Provably Correct Sampler for Probabilistic Programs
- Blog: Probabilistic Data with Continuous Distributions
- Blog: Probabilistic Program Abstractions
- Blog: The Complexity of Verifying Boolean Programs as Differentially Private
- Blog: The Complexity of Verifying Boolean Programs as Differentially Private
- Blog: Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
- Blog: Cost Analysis of Nondeterministic Probabilistic Programs
- Blog: Equivalence and Similarity Refutation for Probabilistic Programs
- Blog: Correctness of Sequential Monte Carlo Inference for Probabilistic Programming Languages
Showing 60 of 110 papers.
History & citation
Current · Permanent link
- Ranking Function Synthesis for Automated Termination Analysis merged into this direction (69% overlap)
- Refuting Equivalence in Probabilistic Systems merged into this direction (75% overlap)
- Proving Probabilistic Termination with Ranking Supermartingales merged into this direction (100% overlap)
- Almost-Sure Termination for Probabilistic Program Inference and Verification merged into this direction (93% overlap)
- Ranking Supermartingales for Probabilistic Program Termination merged into this direction (100% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_quantitative_termination_analysis_a5de582a,
title = {quantitative termination analysis},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quantitative-termination-analysis/rdr_a5de582ac0b84322bad8ec3795212f92},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_quantitative_termination_analysis_a5de582a_v1,
title = {quantitative termination analysis},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/quantitative-termination-analysis/rdr_a5de582ac0b84322bad8ec3795212f92/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}