• CeTA

  • Referenced in 40 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...
  • TOY

  • Referenced in 55 articles [sw09812]
  • programming whose basis is a constructor based rewriting logic with lazy non-deterministic functions...
  • 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...
  • ATERM

  • Referenced in 43 articles [sw03160]
  • well-known library in the term rewriting community. In this paper, we discuss the current...
  • Matchbox

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

  • Referenced in 29 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...
  • 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...
  • HarmonicSums

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

  • Referenced in 28 articles [sw08422]
  • PMaude: Rewrite-based Specification Language for Probabilistic Object Systems. We introduce a rewrite-based specification...
  • Eraser

  • Referenced in 36 articles [sw08922]
  • lock-based multithreaded programs. Eraser uses binary rewriting techniques to monitor every shared-monory reference...
  • MTT

  • Referenced in 20 articles [sw09783]
  • development of the theory of termination of rewriting, its application to high-level 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...
  • AToM3

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

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

  • Referenced in 15 articles [sw09904]
  • Declarative debugging of rewriting logic specifications. Declarative debugging is a semi-automatic technique that starts ... axioms characterizing the elements of a sort. Rewriting logic is a logic of change that ... extends MEL by adding rewrite rules, which correspond to transitions between states ... least sorts with the equational subset of rewriting logic, and rewrites and sets of reachable...
  • GrGen

  • Referenced in 20 articles [sw00387]
  • persistent data storage and querying. Graph rewriting is the high-level way of processing pointer ... graphs, with declarative pattern matching and rewriting, on a visualization of your mesh/network of objects...
  • ProVerif

  • Referenced in 27 articles [sw06558]
  • Diffie-Hellman key agreements, specified both as rewrite rules or as equations. It can handle...
  • TXL

  • Referenced in 15 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 mark-up, rewriting strategies...
  • K tool

  • Referenced in 16 articles [sw09746]
  • 𝕂 framework distilled. 𝕂 is a rewrite-based executable semantic framework in which programming languages ... tasks, such as fragments of program. 𝕂 (rewrite) rules make it explicit which parts ... like any other terms in a rewriting environment: they can be matched, moved from...