Arctic Termination ...Below Zero

DOI10.1007/978-3-540-70590-1_14zbMATH Open1145.68450OpenAlexW1504878076MaRDI QIDQ3522019FDOQ3522019

Authors: Adam Koprowski, Johannes Waldmann 

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_14

Recommendations

• Max/Plus tree automata for termination of term rewriting
• Matrix interpretations for proving termination of term rewriting
• Matrix Interpretations for Proving Termination of Term Rewriting
• Automatic Termination
• Certification of Proving Termination of Term Rewriting by Matrix Interpretations

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Theory and Applications of Satisfiability Testing
• TPA: Termination Proved Automatically
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modular termination proofs for rewriting using dependency pairs
• Termination of term rewriting using dependency pairs
• Title not available (Why is that?)
• Termination proofs and the length of derivations
• Methods and applications of \((\max,+)\) linear algebra
• Tyrolean termination tool: techniques and features
• Proving Termination by Bounded Increase
• Artificial Intelligence and Symbolic Computation
• Termination of String Rewriting with Matrix Interpretations
• The equality problem for rational series with multiplicities in the tropical semiring is undecidable
• Interacting with Modal Logics in the Coq Proof Assistant
• Arctic Termination ...Below Zero
• Termination by Quasi-periodic Interpretations
• Certification of Proving Termination of Term Rewriting by Matrix Interpretations
• Matrix Interpretations for Proving Termination of Term Rewriting
• Weighted automata for proving termination of string rewriting

Cited In (11)

• Increasing Interpretations
• Automatic Termination
• Proving termination of graph transformation systems using weighted type graphs over semirings
• The Derivational Complexity Induced by the Dependency Pair Method
• Termination of cycle rewriting by transformation and matrix interpretation
• KBO orientability
• Joint spectral radius theory for automated complexity analysis of rewrite systems
• Max/Plus tree automata for termination of term rewriting
• Increasing interpretations
• Arctic Termination ...Below Zero
• CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verifications of termination certificates

Uses Software

• Coq

This page was built for publication: Arctic Termination ...Below Zero

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