
CeTA
 Referenced in 42 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...

AIDA
 Referenced in 57 articles
[sw11535]
 invariants: computation of generating sets of invariants, rewritings, syzygies, and their differential analogues. The package...

TOY
 Referenced in 55 articles
[sw09812]
 programming whose basis is a constructor based rewriting logic with lazy nondeterministic functions...

JPAX
 Referenced in 29 articles
[sw09906]
 formulated by the user in the Maude rewriting logic, where Maude is a highspeed ... rewriting system for equational logic, but here extended with executable temporal logic. The Maude rewriting...

SPIRAL
 Referenced in 46 articles
[sw00903]
 algebraic formulation of DSP algorithms, and rewrite rules to generate a large number of implementations...

DACTL
 Referenced in 28 articles
[sw02871]
 generalized computational model based on graph rewriting is presented along with Dactl, an associated compiler ... illustration of the capability of graph rewriting to model a variety of computational formalisms ... languages can be described as graph rewriting transformations using Dactl notation. This is followed...

HarmonicSums
 Referenced in 44 articles
[sw10035]
 integrals and it contains an algorithm which rewrites certain types of nested sums into expressions...

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

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

JavaFAN
 Referenced in 30 articles
[sw01934]
 semantics of Java and JVM in rewriting logic and then using the capabilities of Maude ... execution, search and LTL model checking of rewriting theories...

Matchbox
 Referenced in 24 articles
[sw10115]
 Matchbox: A tool for matchbounded string rewriting. The program Matchbox implements the exact computation ... respect to an (inverse) matchbounded string rewriting system. Matchbox can search for proof ... matchheight properties of a given rewrite system, and some of its transformed variants. This ... proofs of termination for some difficult string rewriting systems...

PMaude
 Referenced in 29 articles
[sw08422]
 PMaude: Rewritebased Specification Language for Probabilistic Object Systems. We introduce a rewritebased specification...

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

Tom
 Referenced in 23 articles
[sw09814]
 Piggybacking Rewriting on Java. We present the Tom language that extends Java with the purpose ... providing high level constructs inspired by the rewriting community. Tom furnishes a bridge between ... language and higher level specifications that use rewriting. This approach was motivated by the promotion ... rewriting techniques and their integration in large scale applications. Powerful matching capabilities along with...

ProVerif
 Referenced in 38 articles
[sw06558]
 DiffieHellman key agreements, specified both as rewrite rules or as equations. It can handle...

MTT
 Referenced in 21 articles
[sw09783]
 development of the theory of termination of rewriting, its application to highlevel programming languages ... inference system rather than just by a rewriting relation. In particular, Generalized Rewrite Theories ... recent generalization of rewrite theories at the heart of the most recent formulation of Maude...

CCSTM
 Referenced in 34 articles
[sw33312]
 scalability are on par with bytecode rewriting STMs...

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

Polyp
 Referenced in 31 articles
[sw09131]
 printers, debuggers, equality functions, unifiers, pattern matchers, rewriting functions, etc. Such functions are called polytypic...

TXL
 Referenced in 17 articles
[sw11319]
 order and backtracking of both parsing and rewriting rules. Using first order functional programming ... higher level and term rewriting at the lower level, TXL provides for flexible programming ... agile parsing, and new paradigms in rewriting, such as XML markup, rewriting strategies...