October 21, 2019 article Open access On probabilistic term rewriting Science of Computer Programming DOI: 10.1016/j.scico.2019.102338 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 9 stored of 34 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 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 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 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 9 results References 0