Paper Info
Title
The York Abstract Machine
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.
Year
DOI
Venue
2008
10.1016/j.entcs.2008.04.045
Electr. Notes Theor. Comput. Sci.
Keywords
Field
DocType
graph transformation rule,graph programming language gp,abstract machine,gp program,backtracking,common target,different platform,graph transformation language,abstract machines,york abstract machine,better efficiency,gp,nondeterminism,direct interpreter,graph transformation,programming language
Graph,Programming language,Computer science,Theoretical computer science,Interpreter,Software portability,Graph rewriting,Abstract semantic graph,Backtracking,Abstract machine
Journal
Volume
ISSN
Citations 
211,
Electronic Notes in Theoretical Computer Science
5
PageRank 
References 
Authors
0.91
2
2
Name
Order
Citations
PageRank
Greg Manning161.33
Detlef Plump260462.14