arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.00828cs.AIcs.PL
收藏

使用连续优化合成程序

Synthesizing Programs with Continuous Optimization

Texas A&M University(德克萨斯农工大学);Intel Labs(英特尔实验室);Merly AI(Merly人工智能公司)

Shantanu Mandal, Todd A. Anderson, Javier Turek, Justin Gottschlich, Abdullah Muzahid

AI总结:

本文将程序合成重新表述为连续优化问题,采用协方差矩阵适应进化策略求解,并提出映射方案转换为实际程序,实验表明GENESYS系统在固定时间预算内比现有技术多合成28%的程序。

摘要:

基于某种规范自动生成软件被称为程序合成。现有的大多数方法将程序合成表述为具有离散参数的搜索问题。在本文中,我们提出了一种将程序合成表述为连续优化问题的新颖形式,并使用一种称为协方差矩阵适应进化策略的最先进进化方法来解决该问题。然后,我们提出了一种映射方案,将连续形式转换为实际程序。我们将名为GENESYS的系统与几种最近的程序合成技术(在离散和连续域中)进行了比较,并表明GENESYS在固定时间预算内比那些现有方案合成了更多的程序。例如,对于长度为10的程序,GENESYS在相同时间预算内比那些现有方案多合成了28%的程序。

英文摘要:

Automatic software generation based on some specification is known as program synthesis. Most existing approaches formulate program synthesis as a search problem with discrete parameters. In this paper, we present a novel formulation of program synthesis as a continuous optimization problem and use a state-of-the-art evolutionary approach, known as Covariance Matrix Adaptation Evolution Strategy to solve the problem. We then propose a mapping scheme to convert the continuous formulation into actual programs. We compare our system, called GENESYS, with several recent program synthesis techniques (in both discrete and continuous domains) and show that GENESYS synthesizes more programs within a fixed time budget than those existing schemes. For example, for programs of length 10, GENESYS synthesizes 28% more programs than those existing schemes within the same time budget.

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

↑