On lexicographic proof rules for probabilistic termination
From MaRDI portal
Cites work
- A decidable propositional dynamic logic with explicit probabilities
- A model-learner pattern for bayesian reasoning
- A probabilistic dynamic logic
- A probabilistic PDL
- Abstraction, Refinement and Proof for Probabilistic Systems
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
- Automated termination analysis of polynomial probabilistic programs
- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
- Cantor meets Scott: semantic foundations for probabilistic networks
- Complexity of Bradley-Manna-Sipma lexicographic ranking functions
- Computer Aided Verification
- Computing expected runtimes for constant probability programs
- Concentration of Measure for the Analysis of Randomized Algorithms
- Deductive proofs of almost sure persistence and recurrence properties
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- Grammar Analysis and Parsing by Abstract Interpretation
- scientific article; zbMATH DE number 1701751 (Why is no real title available?)
- scientific article; zbMATH DE number 1104373 (Why is no real title available?)
- scientific article; zbMATH DE number 1832220 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 1416652 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- New approaches for almost-sure termination of probabilistic programs
- On Lexicographic Proof Rules for Probabilistic Termination
- On probabilistic term rewriting
- On the \textsc{Linear Ranking} problem for integer linear-constraint loops
- On the hardness of analyzing probabilistic programs
- On the Stochastic Matrices Associated with Certain Queuing Processes
- On the termination problem for probabilistic higher-order recursive programs
- Probabilistic NetKAT
- Probabilistic termination by monadic affine sized typing
- Probabilistic termination: soundness, completeness, and compositionality
- Probability with Martingales
- Proving differential privacy via probabilistic couplings
- Ramsey versus lexicographic termination proving
- Reasoning about Recursive Probabilistic Programs
- Semantics of probabilistic programs
- Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
- Static Analysis
- Stochastic invariants for probabilistic termination
- Synthesizing Probabilistic Invariants via Doob’s Decomposition
- Term Rewriting and Applications
- Termination analysis of probabilistic programs through Positivstellensatz's
- Termination of nondeterministic probabilistic programs
- Transition invariants and transition predicate abstraction for program termination
- Verification, Model Checking, and Abstract Interpretation
- Weakest precondition reasoning for expected runtimes of randomized algorithms
Cited in
(1)
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)
