Maximal Termination
From MaRDI portal
Publication:3522012
DOI10.1007/978-3-540-70590-1_8zbMATH Open1145.68446OpenAlexW2911880377MaRDI QIDQ3522012FDOQ3522012
Authors: Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, Peter Schneider-Kamp, René Thiemann, Harald Zankl 
Publication date: 28 August 2008
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_8
Recommendations
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Mechanically proving termination using polynomial interpretations
- Matrix interpretations for proving termination of term rewriting
- Matrix Interpretations for Proving Termination of Term Rewriting
- Search Techniques for Rational Polynomial Orders
Cites Work
- TPA: Termination Proved Automatically
- Termination of term rewriting using dependency pairs
- Title not available (Why is that?)
- Automating the dependency pair method
- Logic for Programming, Artificial Intelligence, and Reasoning
- Tyrolean termination tool: techniques and features
- Mechanizing and improving dependency pairs
- Counterexamples to termination for the direct sum of term rewriting systems
- Proving Termination by Bounded Increase
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Testing positiveness of polynomials
- Proof of termination of the rewriting system SUBSET on CCL
- Maximal Termination
- Polytool: polynomial interpretations as a basis for termination analysis of logic programs
Cited In (20)
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Tuple interpretations for termination of term rewriting
- Multi-dimensional interpretations for termination of term rewriting
- Analysing parallel complexity of term rewriting
- Increasing Interpretations
- Automatic synthesis of logical models for order-sorted first-order theories
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
- KBO orientability
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Ramsey versus lexicographic termination proving
- On complexity bounds and confluence of parallel term rewriting
- Automated Implicit Computational Complexity Analysis (System Description)
- Proving Termination of Integer Term Rewriting
- Increasing interpretations
- Outermost ground termination
- Maximal Termination
- Monotonicity criteria for polynomial interpretations over the naturals
- Automatic proofs of termination with elementary interpretations
- SAT Solving for Termination Analysis with Polynomial Interpretations
- On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs
This page was built for publication: Maximal Termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522012)
