Generating polynomial orderings for termination proofs
From MaRDI portal
Publication:5055845
Recommendations
- Automatic termination proofs with transformation orderings
- Mechanically proving termination using polynomial interpretations
- Generating polynomial orderings
- Orderings and Constraints: Theory and Practice of Proving Termination
- Polynomials over the reals in proofs of termination : from theory to practice
Cites work
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1318515 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Orderings for term-rewriting systems
- Termination of rewriting
- Termination of rewriting systems by polynomial interpretations and its implementation
Cited in
(9)- Orderings and Constraints: Theory and Practice of Proving Termination
- Mechanically proving termination using polynomial interpretations
- Generating polynomial orderings
- Termination analysis for partial functions
- Termination of term rewriting using dependency pairs
- Polynomials over the reals in proofs of termination : from theory to practice
- Modular termination proofs for rewriting using dependency pairs
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
- Termination of constructor systems
This page was built for publication: Generating polynomial orderings for termination proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055845)