Maximal Termination
From MaRDI portal
Publication:3522012
DOI10.1007/978-3-540-70590-1_8zbMath1145.68446OpenAlexW2911880377MaRDI QIDQ3522012
René Thiemann, Aart Middeldorp, Peter Schneider-Kamp, Carsten Fuhs, Harald Zankl, Jürgen Giesl
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
Related Items (14)
Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ KBO orientability ⋮ SAT solving for termination proofs with recursive path orders and dependency pairs ⋮ Automatic synthesis of logical models for order-sorted first-order theories ⋮ Analysing parallel complexity of term rewriting ⋮ Maximal Termination ⋮ Automated Implicit Computational Complexity Analysis (System Description) ⋮ Monotonicity Criteria for Polynomial Interpretations over the Naturals ⋮ Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic ⋮ On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs ⋮ Multi-dimensional interpretations for termination of term rewriting ⋮ Proving Termination of Integer Term Rewriting ⋮ Increasing interpretations ⋮ Tuple interpretations for termination of term rewriting
Cites Work
- Unnamed Item
- Tyrolean termination tool: techniques and features
- Mechanizing and improving dependency pairs
- Counterexamples to termination for the direct sum of term rewriting systems
- Testing positiveness of polynomials
- Proof of termination of the rewriting system SUBSET on CCL
- Termination of term rewriting using dependency pairs
- Automating the dependency pair method
- Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
- Maximal Termination
- TPA: Termination Proved Automatically
- Proving Termination by Bounded Increase
- SAT Solving for Termination Analysis with Polynomial Interpretations
- Logic for Programming, Artificial Intelligence, and Reasoning
This page was built for publication: Maximal Termination
