The York Abstract Machine

被引：1
|
作者：
Manning, Greg [1 ]
Plump, Detlef [1 ]
机构：
[1] Univ York, Dept Comp Sci, York, N Yorkshire, England
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2008年 / 211卷
关键词：
Graph transformation; GP; abstract machines; nondeterminism; backtracking;
D O I：
10.1016/j.entcs.2008.04.045
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页码：231 / 240
页数：10
相关论文
共 50 条
  • [21] Visualizing principles of abstract machines by generating interactive animations
    Diehl, S
    Kunze, T
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING AND ESCIENCE, 2000, 16 (07): : 831 - 839
  • [22] Adaptive Modelling Languages: Abstract Syntax and Model Migration
    DE Lara, Juan
    Cuerra, Esther
    ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2025, 34 (03)
  • [23] Abstract Machines Overlaying Virtual Worlds on Physical Rides
    Tennent, Paul
    Marshall, Joe
    Brundell, Patrick
    Walker, Brendan
    Benford, Steve
    CHI 2019: PROCEEDINGS OF THE 2019 CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, 2019,
  • [24] Towards description and optimization of abstract machines in an extension of prolog
    Morales, Jose F.
    Carro, Manuel
    Hermenegildo, Manuel
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2007, 4407 : 77 - 93
  • [25] Universality and semicomputability for nondeterministic programming languages over abstract algebras
    Jiang, Wei
    Wang, Yuan
    Zucker, Jeffery
    JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING, 2007, 71 (01): : 44 - 78
  • [26] Some Programming Languages Suggested by Game Models (Extended Abstract)
    Longley, John
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 249 : 117 - 134
  • [27] On the practical need for abstraction relations to verify abstract data type representations
    Sitaraman, M
    Weide, BW
    Ogden, WF
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1997, 23 (03) : 157 - 170
  • [28] An Abstract Representation Model for Evolutionary Analysis of Multi-Agent Interactions
    Shaban-Nejad, Arash
    Haarslev, Volker
    2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 2002 - 2009
  • [29] On the syntactic and functional correspondence between hybrid (or layered) normalisers and abstract machines
    Garcia-Perez, A.
    Nogueira, P.
    SCIENCE OF COMPUTER PROGRAMMING, 2014, 95 : 176 - 199
  • [30] Pushdown automata and multicounter machines, a comparison of computation modes - (Extended abstract)
    Hromkovic, J
    Schnitger, G
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 66 - 80
12345