Proving Termination by Bounded Increase
From MaRDI portal
Publication:3608788
DOI10.1007/978-3-540-73595-3_33zbMath1213.68347OpenAlexW1489253037MaRDI QIDQ3608788
Peter Schneider-Kamp, Jürgen Giesl, Stephan Swiderski, René Thiemann
Publication date: 6 March 2009
Published in: Automated Deduction – CADE-21 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73595-3_33
Related Items (10)
Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ Proving termination by dependency pairs and inductive theorem proving ⋮ Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures ⋮ Maximal Termination ⋮ Arctic Termination ...Below Zero ⋮ From Outermost Termination to Innermost Termination ⋮ A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs ⋮ Termination Analysis by Dependency Pairs and Inductive Theorem Proving ⋮ On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs ⋮ Proving Termination of Integer Term Rewriting
This page was built for publication: Proving Termination by Bounded Increase
