January 01, 2004 conference-paper A Complete Method for the Synthesis of Linear Ranking Functions Lecture notes in computer science DOI: 10.1007/978-3-540-24622-0_20 OpenAlex Authors 0 Author list not loaded yet. Cited by 9 stored of 422 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 Liveness Proofs for Hardware Model Checking 2026 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 0 citations Termination of triangular polynomial loops 2023 Formal Methods in System Design article Computer Science Logic, programming, and type systems Open access 8 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 Termination of Polynomial Loops 2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 12 citations 9 results References 0