Generalized ranking supermartingales witness uniqueness of fixed points and thereby enable unified lower-bound verification for termination probability, weakest preexpectation, expected runtime, higher moments, and conditional weakest preexpectation in probabilistic programs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Supermartingales for Unique Fixed Points: A Unified Approach to Lower Bound Verification
Generalized ranking supermartingales witness uniqueness of fixed points and thereby enable unified lower-bound verification for termination probability, weakest preexpectation, expected runtime, higher moments, and conditional weakest preexpectation in probabilistic programs.