January 01, 2019 conference-paper Open access Computing Expected Runtimes for Constant Probability Programs Lecture notes in computer science DOI: 10.1007/978-3-030-29436-6_16 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 11 stored of 19 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 Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks 2026 Lecture notes in computer science conference-paper Open access 0 citations Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting 2024 Lecture notes in computer science conference-paper Computer Science Natural Language Processing Techniques 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 Improving Automatic Complexity Analysis of Integer Programs 2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification 10 citations Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes 2021 other Computer Science Formal Methods in Verification 2 citations Automated Termination Analysis of Polynomial Probabilistic Programs 2021 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 31 citations Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes 2021 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 20 citations Generating Functions for Probabilistic Programs 2021 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 9 citations Inferring Lower Runtime Bounds for Integer Programs 2020 ACM Transactions on Programming Languages and Systems article Computer Science Formal Methods in Verification Open access 12 citations 11 results References 0