Algebraic characterization of runtime pgfs for GCP programs via kernel polynomial roots yields dominant singularities and exact asymptotics for single-state cases.
DecidingFastTerminationforProbabilisticVASSwithNondeterminism, in: Automated Technology for Verification and Analysis: 17th International Symposium (ATVA 2019), Springer Nature
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the algebraic analysis of runtime distribution of probabilistic programs
Algebraic characterization of runtime pgfs for GCP programs via kernel polynomial roots yields dominant singularities and exact asymptotics for single-state cases.