arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2010.03993cs.PL
收藏

改进的GP 2型搅拌器

The Improved GP 2 Compiler

Graham Campbell, Jack Romo, Detlef Plump

摘要:

GP 2是一种基于规则的程序设计语言,它基于图变换规则,旨在方便程序分析和验证。用这种语言编写高效的程序是一个挑战,因为图匹配是昂贵的。GP 2通过提供根规则来解决这个问题,在温和的条件下,这些根规则可以在恒定的时间内匹配。最近,我们对Bak的GP 2-to-C编译器进行了一些更改,以加快图形程序的速度。一个关键的改进是一个新的动态数组数据结构,称为BigArray。这是一个指向条目数组的指针数组,大小依次加倍。为了证明新的实现可实现的速度,我们提出了一个减少程序,用于识别二进制DAG,以前运行在二次时间,但现在运行在线性时间与新的编译器编译时。

英文摘要:

GP 2 is a rule-based programming language based on graph transformation rules which aims to facilitate program analysis and verification. Writing efficient programs in such a language is challenging because graph matching is expensive. GP 2 addresses this problem by providing rooted rules which, under mild conditions, can be matched in constant time. Recently, we implemented a number of changes to Bak's GP 2-to-C compiler in order to speed up graph programs. One key improvement is a new data structure for dynamic arrays called BigArray. This is an array of pointers to arrays of entries, successively doubling in size. To demonstrate the speed-up achievable with the new implementation, we present a reduction program for recognising binary DAGs which previously ran in quadratic time but now runs in linear time when compiled with the new compiler.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑