December 22, 2016 conference-paper Stochastic invariants for probabilistic termination DOI: 10.1145/3009837.3009873 OpenAlex Authors 0 Author list not loaded yet. Cited by 15 stored of 95 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops 2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 1 citations Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks 2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 0 citations Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back 2025 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access 2 citations Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions 2024 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access 11 citations A Deductive Verification Infrastructure for Probabilistic Programs 2023 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access 22 citations The probabilistic termination tool amber 2022 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access 5 citations Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes 2021 other Computer Science Logic, programming, and type systems 2 citations Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning 2021 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access 33 citations Automated Termination Analysis of Polynomial Probabilistic Programs 2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 31 citations Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes 2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 20 citations The Probabilistic Termination Tool Amber 2021 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 15 citations Foundations of probabilistic programming 2021 RWTH Publications (RWTH Aachen) book Computer Science Logic, programming, and type systems Open access 0 citations Expected Runtime Analyis by Program Verification 2020 Cambridge University Press eBooks book-chapter Computer Science Logic, programming, and type systems 12 citations Relatively Complete Verification of Probabilistic Programs 2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access 0 citations Weakest Preexpectation Semantics for Bayesian Inference 2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 5 citations 15 results References 0