Stochastic invariants for probabilistic termination

DOI10.1145/3009837.3009873zbMath1380.68114arXiv1611.01063OpenAlexW2548604229MaRDI QIDQ5370852

Petr Novotný, Krishnendu Chatterjee, Đorđe Žikelić

Publication date: 20 October 2017

Published in: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.01063

zbMATH Keywords

martingalesterminationconcentrationprobabilistic programs

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (9)

Learning probabilistic termination proofs ⋮ A denotational semantics for low-level probabilistic programs with nondeterminism ⋮ The probabilistic termination tool amber ⋮ Unnamed Item ⋮ Automated termination analysis of polynomial probabilistic programs ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes ⋮ Computing expected runtimes for constant probability programs ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Stochastic invariants for probabilistic termination