Orderings and Constraints: Theory and Practice of Proving Termination
From MaRDI portal
Publication:3608810
DOI10.1007/978-3-540-73147-4_2zbMath1186.68233OpenAlexW1606338408MaRDI QIDQ3608810
Albert Rubio, Cristina Borralleras
Publication date: 6 March 2009
Published in: Rewriting, Computation and Proof (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73147-4_2
Related Items
The Computability Path Ordering: The End of a Quest ⋮ Automatic Proofs of Termination With Elementary Interpretations ⋮ On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs
Uses Software