January 01, 2017 conference-paper Open access Proving Termination Through Conditional Termination Lecture notes in computer science DOI: 10.1007/978-3-662-54577-5_6 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 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 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 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 Improving Automatic Complexity Analysis of Integer Programs 2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 10 citations 3 results References 0