October 21, 2016 article Open access Analyzing Program Termination and Complexity Automatically with AProVE Journal of Automated Reasoning DOI: 10.1007/s10817-016-9388-y Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 18 stored of 132 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 Approximately Compatible Graph Predicates 2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 0 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 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 A Divide-and-Conquer Approach to Variable Elimination in Linear Real Arithmetic 2024 Lecture notes in computer science conference-paper Computer Science Polynomial and algebraic computation Open access 3 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 Dependency Pair Framework for Relative Termination of Term Rewriting 2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 2 citations Termination of triangular polynomial loops 2023 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access 8 citations Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) 2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 6 citations Proving Termination of C Programs with Lists 2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 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 A calculus for modular loop acceleration and non-termination proofs 2022 International Journal on Software Tools for Technology Transfer article Computer Science Logic, programming, and type systems Open access 8 citations Improving Automatic Complexity Analysis of Integer Programs 2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 10 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 Termination of Polynomial Loops 2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 12 citations 18 results References 0