Proving Non-looping Non-termination Automatically

DOI10.1007/978-3-642-31365-3_19MaRDI QIDQ2908495zbMATH OpenOpenAlexFDO

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

(6)

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

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)