January 11, 2017 article Open access Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints Journal of Automated Reasoning DOI: 10.1007/s10817-016-9402-4 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 11 stored of 58 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 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 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 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 11 results References 0