October 01, 2019 conference-paper Open access Proving Non-Termination via Loop Acceleration Formal Methods in Computer-Aided Design DOI: 10.23919/fmcad.2019.8894271 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 12 stored of 22 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 AProVE (KoAT + LoAT) 2025 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 5 citations Satisfiability Modulo Exponential Integer Arithmetic 2024 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 4 citations Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) 2023 Lecture notes in computer science conference-paper Computer Science Software Engineering Research Open access 6 citations ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses 2023 Lecture notes in computer science conference-paper Computer Science Software Testing and Debugging Techniques 5 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 A calculus for modular loop acceleration and non-termination proofs 2022 International Journal on Software Tools for Technology Transfer article Computer Science Formal Methods in Verification Open access 8 citations Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description) 2022 Lecture notes in computer science conference-paper Computer Science Parallel Computing and Optimization Techniques Open access 16 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 AProVE: Non-Termination Witnesses for C Programs 2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 10 citations Improving Automatic Complexity Analysis of Integer Programs 2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification 10 citations Inferring Lower Runtime Bounds for Integer Programs 2020 ACM Transactions on Programming Languages and Systems article Computer Science Formal Methods in Verification Open access 12 citations Termination of Polynomial Loops 2020 Lecture notes in computer science conference-paper Engineering graph theory and CDMA systems 12 citations 12 results References 0