• Matchbox

  • Referenced in 25 articles [sw10115]
  • Matchbox: A tool for match-bounded string rewriting. The program Matchbox implements the exact computation ... terminating strings, with ... respect to an (inverse) match-bounded string rewriting system. Matchbox can search for proof ... proofs of termination for some difficult string rewriting systems...
  • TORPA

  • Referenced in 10 articles [sw10120]
  • used to prove termination of string rewriting systems (SRSs) fully automatically. The underlying techniques include...
  • Jambox

  • Referenced in 14 articles [sw10066]
  • automated termination prover for string and term rewriting systems...
  • PYTHIA8

  • Referenced in 108 articles [sw09347]
  • showers, multiple parton-parton interactions, beam remnants, string fragmentation and particle decays. It also ... Fortran, Pythia 8 represents a complete rewrite in C++. The current release is the first...
  • XSSR

  • Referenced in 3 articles [sw02306]
  • XSSR: An experimental system for string rewriting -- decision problems, algorithms, and implementation. Here we present ... eXperimental System for String Rewriting, XSSR, which is a special purpose computer algebra system ... adopted to the special situation of string rewriting systems at hand...
  • MAMMUT

  • Referenced in 1 article [sw02504]
  • application (e.g., initializing a string, rewriting a tree). Finally, the interface is specified formally...
  • CLEAN

  • Referenced in 58 articles [sw01346]
  • Clean among which it’s Term Graph Rewriting semantics. Of particular importance for practical ... needed for storing (converting data to string) and retrieving (by means of a parser...
  • OntoPlant

  • Referenced in 0 articles [sw19011]
  • flexibility as a process of string rewriting. VisForest is a software platform for creating...
  • BibTool

  • Referenced in 1 article [sw33721]
  • regular expressions to specify the rewriting rules; Macro (String) expansion to eliminate the need...
  • LindenmayeR

  • Referenced in 0 articles [sw15177]
  • systems or Lindenmayer systems are parallel rewriting systems which can be used to simulate biological ... system a series of symbols in a string are replaced iteratively according to rules...
  • ATLAS

  • Referenced in 197 articles [sw00056]
  • This paper describes the Automatically Tuned Linear Algebra...
  • Boolector

  • Referenced in 28 articles [sw00085]
  • Boolector: an efficient SMT solver for bit-vectors...
  • Coq

  • Referenced in 1807 articles [sw00161]
  • Coq is a formal proof management system. It...
  • GAP

  • Referenced in 2876 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • GRM

  • Referenced in 4 articles [sw00391]
  • Weighted Grammar Tools: The GRM Library. We describe...
  • LANGAGE

  • Referenced in 36 articles [sw00501]
  • LANGAGE: A Maple package for automaton characterization of...
  • Magma

  • Referenced in 2917 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 5124 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 5957 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • MiniSat

  • Referenced in 536 articles [sw00577]
  • An extensible SAT-solver. MiniSat is a minimalistic...