January 01, 2017 conference-paper Complexity Analysis for Term Rewriting by Integer Transition Systems Lecture notes in computer science DOI: 10.1007/978-3-319-66167-4_8 OpenAlex Authors 0 Author list not loaded yet. Cited by 4 stored of 14 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 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 A Dependency Pair Framework for Relative Termination of Term Rewriting 2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 2 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 4 results References 0