September 01, 2019 article Open access Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis Theory and Practice of Logic Programming DOI: 10.1017/s1471068419000310 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 7 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 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 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 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 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 7 results References 0