Syntax-guided synthesis

2013 Formal Methods in Computer-Aided Design Pub Date : 2013-10-01 DOI:10.3233/978-1-61499-495-4-1

R. Alur, R. Bodík, Garvit Juniwal, Milo M. K. Martin, Mukund Raghothaman, S. Seshia, Rishabh Singh, Armando Solar-Lezama, E. Torlak, A. Udupa

{"title":"Syntax-guided synthesis","authors":"R. Alur, R. Bodík, Garvit Juniwal, Milo M. K. Martin, Mukund Raghothaman, S. Seshia, Rishabh Singh, Armando Solar-Lezama, E. Torlak, A. Udupa","doi":"10.3233/978-1-61499-495-4-1","DOIUrl":null,"url":null,"abstract":"The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementations. Our goal is to identify the core computational problem common to these proposals in a logical framework. The input to the syntax-guided synthesis problem (SyGuS) consists of a background theory, a semantic correctness specification for the desired program given by a logical formula, and a syntactic set of candidate implementations given by a grammar. The computational problem then is to find an implementation from the set of candidate expressions so that it satisfies the specification in the given theory. We describe three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the synthesis problem, report on prototype implementations, and present experimental results on an initial set of benchmarks.","PeriodicalId":346097,"journal":{"name":"2013 Formal Methods in Computer-Aided Design","volume":"124 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"691","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Formal Methods in Computer-Aided Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/978-1-61499-495-4-1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 691

Abstract

The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementations. Our goal is to identify the core computational problem common to these proposals in a logical framework. The input to the syntax-guided synthesis problem (SyGuS) consists of a background theory, a semantic correctness specification for the desired program given by a logical formula, and a syntactic set of candidate implementations given by a grammar. The computational problem then is to find an implementation from the set of candidate expressions so that it satisfies the specification in the given theory. We describe three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the synthesis problem, report on prototype implementations, and present experimental results on an initial set of benchmarks.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Syntax-guided合成

程序综合问题的经典表述是找到一个满足以逻辑公式形式给出的正确性规范的程序。最近在程序综合和程序优化方面的工作说明了允许用户用语法模板来补充逻辑规范的许多潜在好处，语法模板限制了允许实现的空间。我们的目标是在一个逻辑框架中确定这些建议共有的核心计算问题。语法引导的合成问题(SyGuS)的输入包括背景理论、由逻辑公式给出的所需程序的语义正确性规范，以及由语法给出的候选实现的语法集。然后，计算问题是从候选表达式集合中找到一个实现，使其满足给定理论中的规范。我们描述了解决合成问题的反示例引导诱导合成(CEGIS)策略的三种不同实例，报告了原型实现，并在一组初始基准上给出了实验结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2013 Formal Methods in Computer-Aided Design

自引率

0.00%

发文量

期刊最新文献

Efficient handling of obligation constraints in synthesis from omega-regular specifications Verifying global convergence for a digital phase-locked loop Relational STE and theorem proving for formal verification of industrial circuit designs Verifying multi-threaded software with impact Formal co-validation of low-level hardware/software interfaces