The York Abstract Machine

Greg Manning, Detlef Plump

Research output: Contribution to journalArticlepeer-review

Abstract

We introduce the York Abstract Machine (YAM) for implementing the graph programming language GP and, potentially, other graph transformation languages. The advantages of an abstract machine over a direct interpreter for graph transformation rules are better efficiency, use as a common target for compiling both future versions of GP and other languages, and portability of GP programs to different platforms.
Original languageEnglish
Pages (from-to)231-240
JournalElectronic Notes in Theoretical Computer Science
Volume211
DOIs
Publication statusPublished - 1 Apr 2008

Keywords

  • GP, Graph transformation, abstract machines, backtracking, nondeterminism

Cite this