
RRL
 Referenced in 55 articles
[sw28904]
 algorithms for equational logic based on rewrite techniques. It has now matured into a full...

Eraser
 Referenced in 45 articles
[sw08922]
 based multithreaded programs. Eraser uses binary rewriting techniques to monitor every sharedmonory reference...

VAMPIRE
 Referenced in 258 articles
[sw02918]
 number of standard redundancy criteria and simplification techniques are used for pruning the search space ... tautology deletion (optionally modulo commutativity), subsumption resolution, rewriting by ordered unit equalities, and a lightweight ... this CASC. A number of efficient indexing techniques are used to implement all major operations...

AToM3
 Referenced in 32 articles
[sw10092]
 formalism. AToM 3 relies on graph rewriting techniques and graph grammars to perform the transformations...

Tom
 Referenced in 25 articles
[sw09814]
 motivated by the promotion of rewriting techniques and their integration in large scale applications. Powerful...

AProVE
 Referenced in 160 articles
[sw07831]
 systems for automated termination proofs of term rewrite systems (TRSs). It is the first tool ... completely flexible combination of different termination proof techniques. Due to this framework, AProVE...

Tyrolean
 Referenced in 89 articles
[sw07830]
 rewrite systems. It is the completely redesigned successor of TTT. Current (non)termination techniques include...

A3PAT
 Referenced in 8 articles
[sw21587]
 developments: the Coccinelle library formalises numerous rewriting techniques and termination criteria for the Coq proof ... assistant; the CiME3 rewriting tool translates termination proofs (discovered by itself or other tools) into ... propose the first full Coq formalisation). Techniques employed in CiME3 also improve on previous works...

MOMENT2
 Referenced in 10 articles
[sw10025]
 Modeling Framework using graph transformation and rewriting logic techniques. We illustrate our approach...

APS
 Referenced in 29 articles
[sw08969]
 main paradigms of computations: procedural, functional, algebraic (rewriting rules) and logical. All of them ... techniques for APS are presented and discussed. These include data structures, algebraic modules, rewriting...

CeTA
 Referenced in 47 articles
[sw06584]
 first formalized the required theory of term rewriting including three major termination criteria: dependency pairs ... reduction pairs. Second, for each of these techniques we developed an executable check which guarantees...

CSI
 Referenced in 22 articles
[sw09767]
 term rewrite systems. Due to its modular design, the few techniques implemented...

XSSR
 Referenced in 3 articles
[sw02306]
 University of Kassel, is based on rewriting techniques, adopted to the special situation of string...

CLEAN
 Referenced in 58 articles
[sw01346]
 Clean among which it’s Term Graph Rewriting semantics. Of particular importance for practical ... dynamic linking, justintime compilation, coding techniques for data and version management of code...

DistOrc
 Referenced in 5 articles
[sw10063]
 have been proposed for Orc, including a rewriting logic semantics developed by the authors ... Specifically, we describe an implementation technique based on rewriting logic and Maude that narrows this...

PMaude
 Referenced in 31 articles
[sw08422]
 Probabilistic Object Systems. We introduce a rewritebased specification language for modelling probabilistic concurrent ... probabilistic model. We also describe a statistical technique to evaluate QuaTEx expressions for a probabilistic...

DDebugger
 Referenced in 15 articles
[sw09904]
 debugging of rewriting logic specifications. Declarative debugging is a semiautomatic technique that starts from ... axioms characterizing the elements of a sort. Rewriting logic is a logic of change that...

TORPA
 Referenced in 10 articles
[sw10120]
 termination of string rewriting systems (SRSs) fully automatically. The underlying techniques include semantic labelling, polynomial...

Bloqqer
 Referenced in 30 articles
[sw09578]
 solvers are available. Despite sophisticated evaluation techniques, the performance of such a solver usually depends ... these issues, preprocessors have been introduced which rewrite a given QBF before it is passed ... based on blocked clause elimination (BCE), a technique successfully applied in SAT. Quantified blocked clause...

SPIRAL
 Referenced in 48 articles
[sw00903]
 algebraic formulation of DSP algorithms, and rewrite rules to generate a large number of implementations ... system, briefly discusses the use of algebraic techniques in the generation of DSP algorithms...