January 01, 2019 conference-paper Open access The Termination and Complexity Competition Lecture notes in computer science DOI: 10.1007/978-3-030-17502-3_10 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 21 stored of 50 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 Modular Automatic Complexity Analysis of Recursive Integer Programs 2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 1 citations On Deciding Constant Runtime of Linear Loops 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 KoAT: Automatic Complexity and Termination Analysis of Integer Programs 2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 0 citations AProVE (KoAT + LoAT) 2025 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 5 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 Satisfiability Modulo Exponential Integer Arithmetic 2024 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 4 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 Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs 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 Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops 2022 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 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 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 Inferring Lower Runtime Bounds for Integer Programs 2020 ACM Transactions on Programming Languages and Systems article Computer Science Logic, programming, and type systems Open access 12 citations Polynomial Loops: Beyond Termination 2020 EPiC series in computing conference-paper Computer Science Logic, programming, and type systems Open access 13 citations 1–20 of 21 Page 1 / 2 Next → References 0