October 10, 2019 article Open access Modular verification for almost-sure termination of probabilistic programs Proceedings of the ACM on Programming Languages DOI: 10.1145/3360555 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 10 stored of 41 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 Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting 2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access 1 citations Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting 2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 0 citations From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting 2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 2 citations A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting 2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 2 citations Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs 2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 7 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 Relatively Complete Verification of Probabilistic Programs 2020 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access 0 citations 10 results References 0