Drags: A compositional algebraic framework for graph rewriting

Nachum Dershowitz, Jean Pierre Jouannaud*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We are interested in a natural generalization of term-rewriting techniques to what we call drags, viz. finite, directed, ordered, rooted multigraphs, each vertex of which is labeled by a function symbol. To this end, we develop a rich algebra of drags that generalizes the familiar term algebra and its associated rewriting capabilities. Viewing graphs as terms provides an initial building block for rewriting with such graphs, one that should impact the many areas where computations take place on graphs.

Original languageEnglish
Pages (from-to)204-231
Number of pages28
JournalTheoretical Computer Science
StatePublished - 19 Jul 2019


  • Drags


Dive into the research topics of 'Drags: A compositional algebraic framework for graph rewriting'. Together they form a unique fingerprint.

Cite this