
OTTER
 Referenced in 245 articles
[sw02904]
 paramodulation, and it includes facilities for term rewriting, term orderings, KnuthBendix completion, weighting...

AProVE
 Referenced in 128 articles
[sw07831]
 systems for automated termination proofs of term rewrite systems (TRSs). It is the first tool...

Tyrolean
 Referenced in 83 articles
[sw07830]
 automatically proving (and disproving) termination of term rewrite systems. It is the completely redesigned successor...

Timbuk
 Referenced in 40 articles
[sw06351]
 achieving proofs of reachability over Term Rewriting Systems and for manipulating Tree Automata (bottom ... manipulation on Tree Automata, alphabets, terms, Term Rewriting Systems...

CLEAN
 Referenced in 53 articles
[sw01346]
 functional language based on Term Graph Rewriting. It is specially designed to make the development ... language Clean among which it’s Term Graph Rewriting semantics. Of particular importance for practical...

ELAN
 Referenced in 91 articles
[sw02179]
 function evaluation principle based on rewriting. But rewriting is inherently nondeterministic since several rules ... applied at different positions in a same term, and in ELAN, a computation may have ... contrast to many existing rewritingbased languages where the term reduction strategy is hardwired ... strategy operators and define them by rewrite rules. Evaluation of strategy application is itself based...

ATERM
 Referenced in 36 articles
[sw03160]
 wellknown library in the term rewriting community. In this paper, we discuss the current...

CeTA
 Referenced in 25 articles
[sw06584]
 automatic tools to prove termination of term rewrite systems, nowadays. Most of these tools ... first formalized the required theory of term rewriting including three major termination criteria: dependency pairs...

CoLoR
 Referenced in 30 articles
[sw09806]
 CoLoR: a Coq library on wellfounded rewrite relations and its application to the automated ... Turingcomplete formalism of term rewriting. Over the years, many methods and tools have been...

MUTERM
 Referenced in 32 articles
[sw10015]
 term: A Tool for Proving Termination of ContextSensitive Rewriting. Restrictions of rewriting can eventually ... rewrite sequences issued from every term. Contextsensitive rewriting (CSR) is an example of such ... permanently forbidden. This paper describes muterm, a tool which can be used to automatically ... first termination tool which generates term orderings based on such polynomial interpretations. These orderings...

Boolector
 Referenced in 19 articles
[sw00085]
 vectors and arrays. It uses term rewriting, bitblasting to handle bitvectors, and lemmas...

Jambox
 Referenced in 13 articles
[sw10066]
 automated termination prover for string and term rewriting systems...

CSI
 Referenced in 13 articles
[sw09767]
 describes a new confluence tool for term rewrite systems. Due to its modular design...

Autowrite
 Referenced in 8 articles
[sw01282]
 tool for checking properties of term rewriting systems Huet and Lévy have shown that ... class of orthogonal term rewriting systems (TRSs) every term not in normal form contains ... redex contracted in every normalizing rewrite sequence) and that repeated contraction of needed redexes results...

TPA
 Referenced in 12 articles
[sw10114]
 tool for proving termination of term rewrite systems (TRSs) in a fully automated fashion...

VMTL
 Referenced in 8 articles
[sw10065]
 automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention ... analyzing the termination behaviour of conditional term rewriting systems (CTRSs). Using one of the latest...

TXL
 Referenced in 8 articles
[sw11319]
 programming at the higher level and term rewriting at the lower level, TXL provides...

K tool
 Referenced in 13 articles
[sw09746]
 program. 𝕂 (rewrite) rules make it explicit which parts of the term they readonly ... Computations are like any other terms in a rewriting environment: they can be matched, moved...

A3PAT
 Referenced in 7 articles
[sw21587]
 rulebased programming or specifications often use rewriting systems for which termination, among other properties ... with full automation, termination proofs for term rewriting systems. It consists of two developments...

VAMPIRE
 Referenced in 179 articles
[sw02918]
 tautology deletion (optionally modulo commutativity), subsumption resolution, rewriting by ordered unit equalities, and a lightweight ... implement all major operations on sets of terms and clauses. Runtime algorithm specialisation...