Proving Non-looping Non-termination Automatically
From MaRDI portal
Publication:2908495
DOI10.1007/978-3-642-31365-3_19zbMath1358.68157OpenAlexW197252015MaRDI QIDQ2908495
Jürgen Giesl, Fabian Emmes, Tim Enger
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ Decision tree learning in CEGIS-based termination analysis ⋮ Lower bounds for runtime complexity of term rewriting
This page was built for publication: Proving Non-looping Non-termination Automatically
