Orderings and Constraints: Theory and Practice of Proving Termination

DOI10.1007/978-3-540-73147-4_2zbMATH Open1186.68233OpenAlexW1606338408MaRDI QIDQ3608810FDOQ3608810

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

Recommendations

• Automatic termination proofs with transformation orderings
• scientific article; zbMATH DE number 3930339
• Polynomials over the reals in proofs of termination : from theory to practice
• Topics in termination
• Generating polynomial orderings for termination proofs

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (8)

• The Computability Path Ordering: The End of a Quest
• Cyclic proofs with ordering constraints
• Generating polynomial orderings for termination proofs
• Automatic Proofs of Termination With Elementary Interpretations
• On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs
• Automated Reasoning
• Proving Termination Using Recursive Path Orders and SAT Solving
• Solving Partial Order Constraints for LPO Termination

Uses Software

• CARIBOO

This page was built for publication: Orderings and Constraints: Theory and Practice of Proving Termination

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