January 01, 2014 conference-paper Open access Proving Non-termination Using Max-SMT Lecture notes in computer science DOI: 10.1007/978-3-319-08867-9_52 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 5 stored of 56 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 Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks 2026 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 0 citations Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) 2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 6 citations 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 Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description) 2022 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access 16 citations Termination of Polynomial Loops 2020 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems 12 citations 5 results References 0