Proving Termination of Rewrite Systems Using Bounds
From MaRDI portal
Publication:5432346
DOI10.1007/978-3-540-73449-9_21zbMath1203.68077OpenAlexW1802519271MaRDI QIDQ5432346
Publication date: 2 January 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_21
Related Items
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations, Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems, Beyond Dependency Graphs, Automatic Termination, Match-bounds revisited, Increasing interpretations, Increasing Interpretations
Uses Software