March 06, 2018 article Open access Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution Journal of Logical and Algebraic Methods in Programming DOI: 10.1016/j.jlamp.2018.02.004 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 5 stored of 9 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 AProVE (KoAT + LoAT) 2025 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 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 AProVE: Non-Termination Witnesses for C Programs 2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 10 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 5 results References 0