Proving Termination by Bounded Increase

DOI10.1007/978-3-540-73595-3_33zbMATH Open1213.68347OpenAlexW1489253037MaRDI QIDQ3608788FDOQ3608788

Authors: Jürgen Giesl, René Thiemann, Stephan Swiderski, Peter Schneider-Kamp 

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

Recommendations

• Formalizing bounded increase
• Termination Analysis by Dependency Pairs and Inductive Theorem Proving
• Proving termination by dependency pairs and inductive theorem proving
• Termination of term rewriting using dependency pairs
• On proving termination by innermost termination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (11)

• Analyzing program termination and complexity automatically with \textsf{AProVE}
• Termination Analysis by Dependency Pairs and Inductive Theorem Proving
• Proving termination by dependency pairs and inductive theorem proving
• Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
• Proving Termination of Integer Term Rewriting
• Arctic Termination ...Below Zero
• Maximal Termination
• Formalizing bounded increase
• From Outermost Termination to Innermost Termination
• A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
• On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs

This page was built for publication: Proving Termination by Bounded Increase

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