On lexicographic proof rules for probabilistic termination
From MaRDI portal
Publication:6610383
DOI10.1145/3585391MaRDI QIDQ6610383
Krishnendu Chatterjee, [[Person:6488474|Author name not available (Why is that?)]], Petr Novotný, [[Person:6488475|Author name not available (Why is that?)]], Đorđe Žikelić
Publication date: 25 September 2024
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A probabilistic dynamic logic
- A probabilistic PDL
- Semantics of probabilistic programs
- On probabilistic term rewriting
- Complexity of Bradley-Manna-Sipma lexicographic ranking functions
- On the hardness of analyzing probabilistic programs
- Automated termination analysis of polynomial probabilistic programs
- Deductive proofs of almost sure persistence and recurrence properties
- Termination of nondeterministic probabilistic programs
- Computing expected runtimes for constant probability programs
- Probabilistic NetKAT
- Probabilistic termination: soundness, completeness, and compositionality
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- On the linear ranking problem for integer linear-constraint loops
- A model-learner pattern for bayesian reasoning
- Probabilistic Termination by Monadic Affine Sized Typing
- Transition Invariants and Transition Predicate Abstraction for Program Termination
- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
- Grammar Analysis and Parsing by Abstract Interpretation
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- A decidable propositional dynamic logic with explicit probabilities
- Probability with Martingales
- Weakest Precondition Reasoning for Expected Runtimes of Randomized Algorithms
- Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
- Synthesizing Probabilistic Invariants via Doob’s Decomposition
- Reasoning about Recursive Probabilistic Programs
- Proving Differential Privacy via Probabilistic Couplings
- Abstraction, Refinement and Proof for Probabilistic Systems
- Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
- Ramsey vs. Lexicographic Termination Proving
- Stochastic invariants for probabilistic termination
- Cantor meets Scott: semantic foundations for probabilistic networks
- Term Rewriting and Applications
- Computer Aided Verification
- On the Stochastic Matrices Associated with Certain Queuing Processes
- Concentration of Measure for the Analysis of Randomized Algorithms
- Static Analysis
- Verification, Model Checking, and Abstract Interpretation
- New approaches for almost-sure termination of probabilistic programs
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
- On Lexicographic Proof Rules for Probabilistic Termination
This page was built for publication: On lexicographic proof rules for probabilistic termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610383)
