October 01, 2013 conference-paper Open access Proving termination of imperative programs using Max-SMT Formal Methods in Computer-Aided Design DOI: 10.1109/fmcad.2013.6679413 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 47 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 Termination of triangular polynomial loops 2023 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access 8 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 Termination of Polynomial Loops 2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 12 citations 3 results References 0