January 01, 2016 conference-paper Lower Runtime Bounds for Integer Programs Lecture notes in computer science DOI: 10.1007/978-3-319-40229-1_37 OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 29 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 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 Expected Runtime Analyis by Program Verification 2020 Cambridge University Press eBooks book-chapter Computer Science Logic, programming, and type systems 12 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 4 results References 0