November 13, 2020 article Open access A modular cost analysis for probabilistic programs Proceedings of the ACM on Programming Languages DOI: 10.1145/3428240 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 13 stored of 42 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 Highly Incremental: A Simple Programmatic Approach for Many Objectives 2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 1 citations Caesar: A Deductive Verifier for Probabilistic Programs 2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 0 citations 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 Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT (Short Paper) 2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 6 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 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 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 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 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 13 results References 0