Proving Non-looping Non-termination Automatically

DOI10.1007/978-3-642-31365-3_19zbMATH Open1358.68157OpenAlexW197252015MaRDI QIDQ2908495FDOQ2908495

Authors: Fabian Emmes, Tim Enger, Jürgen Giesl 

Publication date: 5 September 2012

Published in: Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31365-3_19

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (5)

• Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Decision tree learning in CEGIS-based termination analysis
• Non-termination in Term Rewriting and Logic Programming
• Lower bounds for runtime complexity of term rewriting

This page was built for publication: Proving Non-looping Non-termination Automatically

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908495)