Probabilistic Termination
From MaRDI portal
Publication:2819834
DOI10.1145/2676726.2677001zbMath1345.68104OpenAlexW2166496828MaRDI QIDQ2819834
Luis María Ferrer Fioriti, Holger Hermanns
Publication date: 29 September 2016
Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2676726.2677001
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Generalizations of martingales (60G48) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (23)
Learning probabilistic termination proofs ⋮ A denotational semantics for low-level probabilistic programs with nondeterminism ⋮ On the Hardness of Almost–Sure Termination ⋮ The probabilistic termination tool amber ⋮ Unnamed Item ⋮ Time-bounded termination analysis for probabilistic programs with delays ⋮ On Higher-Order Probabilistic Subrecursion ⋮ Probabilistic Termination by Monadic Affine Sized Typing ⋮ Unnamed Item ⋮ Confluence and convergence modulo equivalence in probabilistically terminating reduction systems ⋮ On the hardness of analyzing probabilistic programs ⋮ Toward automatic verification of quantum programs ⋮ Automated termination analysis of polynomial probabilistic programs ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems ⋮ On randomised strategies in the \(\lambda \)-calculus ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes ⋮ Computing expected runtimes for constant probability programs ⋮ Probabilistic Analysis of Binary Sessions ⋮ Unnamed Item ⋮ Moment-based analysis of Bayesian network properties
This page was built for publication: Probabilistic Termination
