论文标题
改进GP 2编译器
Improving the GP 2 Compiler
论文作者
论文摘要
GP 2是一种基于图形转换规则的实验编程语言，旨在促进程序分析和验证。用这种语言编写有效的程序很难，因为图形匹配很昂贵，但是GP 2通过提供扎根的规则来解决此问题，在轻度条件下可以使用GP 2使用GP 2到C编译器，该规则可以在恒定时间内匹配。在本报告中，我们记录了对编译器的各种改进；最值得注意的是，引入节点列表以改善破坏性程序的迭代性能，这意味着通过减少的二进制DAG识别只需要花费时间性时间，而先前的实现需要二次时间。
GP 2 is an experimental programming language based on graph transformation rules which aims to facilitate program analysis and verification. Writing efficient programs in such a language is hard because graph matching is expensive, however GP 2 addresses this problem by providing rooted rules which, under mild conditions, can be matched in constant time using the GP 2 to C compiler. In this report, we document various improvements made to the compiler; most notably the introduction of node lists to improve iteration performance for destructive programs, meaning that binary DAG recognition by reduction need only take linear time where the previous implementation required quadratic time.
