arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.03649cs.PLcs.NEcs.SE
收藏

代码构建遗传编程

Code Building Genetic Programming

Edward Pantridge, Lee Spector

摘要:

近年来,遗传编程领域在自动编程方面取得了重大进展。当代程序合成方法的研究和开发,如PushGP和语法指导的遗传编程,可以产生解决在介绍性学术环境中通常分配的问题的程序。这些问题集中在一组狭窄的、预定的简单数据结构、基本控制流模式和基本的、非重叠的数据类型(没有例如继承或复合类型)。很少有(如果有的话)用于程序合成的遗传编程方法令人信服地证明了合成使用任意数据类型、数据结构和从现有代码库中提取的规范的程序的能力。在本文中,我们引入代码构建遗传编程(CBGP)作为一个框架内,这可以做到这一点,利用程序设计语言功能,如反射和一流的规格。CBGP产生一个计算图,可以执行或翻译成宿主语言的源代码。为了证明CBGP的新功能,我们提出了新的基准测试结果,使用非原始的,多态数据类型以及一些标准的程序合成基准。

英文摘要:

In recent years the field of genetic programming has made significant advances towards automatic programming. Research and development of contemporary program synthesis methods, such as PushGP and Grammar Guided Genetic Programming, can produce programs that solve problems typically assigned in introductory academic settings. These problems focus on a narrow, predetermined set of simple data structures, basic control flow patterns, and primitive, non-overlapping data types (without, for example, inheritance or composite types). Few, if any, genetic programming methods for program synthesis have convincingly demonstrated the capability of synthesizing programs that use arbitrary data types, data structures, and specifications that are drawn from existing codebases. In this paper, we introduce Code Building Genetic Programming (CBGP) as a framework within which this can be done, by leveraging programming language features such as reflection and first-class specifications. CBGP produces a computational graph that can be executed or translated into source code of a host language. To demonstrate the novel capabilities of CBGP, we present results on new benchmarks that use non-primitive, polymorphic data types as well as some standard program synthesis benchmarks.

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

↑