No longer in OpenAlex W2981410213 OpenAlex Authors 0 Author list not loaded yet. Cited by 12 stored of 0 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 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 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 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 Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description) 2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 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 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 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 20 citations Polynomial Loops: Beyond Termination 2020 EPiC series in computing conference-paper Computer Science Logic, programming, and type systems Open access 13 citations Termination of Polynomial Loops 2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 12 citations 12 results References 0