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

PROGRES
 Referenced in 70 articles
[sw02905]
 type concept. It supports programming with graph rewriting systems. An integrated typechecker is able...

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...

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

Quantomatic
 Referenced in 22 articles
[sw10107]
 Exploring a quantum theory with graph rewriting and computer algebra. It can be useful ... many calculations. However, manual manipulation of graphs describing such systems quickly becomes untenable for large ... automated and semiautomated explorations of graph rewrite systems and their underlying semantics. We emphasise ... identities and use those identities as graph rewrites to expand the theory...

PORGY
 Referenced in 14 articles
[sw06923]
 interactions on dynamic graphs emerging from graph rewriting systems. Graph rewriting systems appear ... simulation of the rewriting calculus will offer the expert a unique mean of interacting with ... study, turning interactive visualisation of graph rewriting systems into a highlevel visual programming environment...

GrGen
 Referenced in 21 articles
[sw00387]
 persistent data storage and querying. Graph rewriting is the highlevel way of processing pointer ... abstraction level of graphs, with declarative pattern matching and rewriting, on a visualization of your...

Sparkle
 Referenced in 14 articles
[sw09803]
 semantics based on lazy graphrewriting. This allows reasoning to take place on the program...

AGREE
 Referenced in 12 articles
[sw23738]
 AGREE – algebraic graph rewriting with controlled embedding. The several algebraic approaches to graph transformation proposed...

Tyrolean
 Referenced in 91 articles
[sw07830]
 automatically proving (and disproving) termination of term rewrite systems. It is the completely redesigned successor ... Current (non)termination techniques include: approximated dependency graph, argument filtering, bounds, dependency pair method, Knuth...

LMNtal
 Referenced in 9 articles
[sw07312]
 simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity...

CeTA
 Referenced in 47 articles
[sw06584]
 term rewriting including three major termination criteria: dependency pairs, dependency graphs, and reduction pairs. Second...

GGL
 Referenced in 4 articles
[sw22850]
 library  a generic framework for chemical graph rewrite systems. Graph rewrite systems are powerful tools ... available at the moment [8]. The Graph Grammar Library (GGL), presented in this contribution ... Double Push Out approach for general graph rewrite systems [7] on labeled undirected graphs...

Hornlog
 Referenced in 6 articles
[sw21362]
 logic programming interpreters based on graph rewriting and on a lineartime algorithm for showing...

MONSTR
 Referenced in 5 articles
[sw07071]
 implementation of an extended term graph rewriting model of computation (described by the DACTL language...

MOMENT2
 Referenced in 10 articles
[sw10025]
 MOMENT2. We give a realtime rewrite formal semantics to realtime model transformations ... Eclipse Modeling Framework using graph transformation and rewriting logic techniques. We illustrate our approach...

GReAT
 Referenced in 4 articles
[sw22852]
 Graph Rewriting and Transformation Language: GReAT. In this paper, we describe the language and features ... graph transformation tool, GReAT.We begin with a brief introduction and motivation, followed by an overview...

GMTE
 Referenced in 2 articles
[sw07046]
 main tasks: graph matching and graph rewriting. At present, few graph transformation tools support multi ... rewriting rules to be used. In this paper, we present the tool GMTE  graph matching ... GMTE handles the inexact graph matching. The approach of rewriting rules used by GMTE combines ... extends the expressiveness of the graph rewriting rules. In addition, for the graph matching, GMTE...

Polar
 Referenced in 2 articles
[sw07906]
 prototype refactoring framework based on graph rewriting and bidirectional transformations that is designed ... declarative. Our approach uses a languageindependent graph metamodel to represent proof developments ... generic way. We use graph rewriting to enrich the metamodel with dependency information...

Metatheory.jl
 Referenced in 1 article
[sw37953]
 core feature of Metatheory.jl is egraph rewriting, a fresh approach to term rewriting achieved ... kinds of formal systems, by defining concise rewriting rules in pure, syntactically valid Julia ... implementation of equality saturation on egraphs is based on the excellent, state...