检索结果-内蒙古大学图书馆

S3: Syntax- and Semantic-Guided Repair Synthesis via programming by examples 2017

S3: Syntax- and Semantic-Guided Repair Synthesis via Program...

11th Joint Meeting of European Software Engineering Conference (ESEC) / ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)

作者： Le, Xuan-Bach D. Chu, Duc-Hiep Lo, David Le Goues, Claire Visser, Willem Singapore Management Univ Singapore Singapore IST Austria Klosterneuburg Austria Carnegie Mellon Univ Pittsburgh PA 15213 USA Stellenbosch Univ Stellenbosch South Africa

ISBN: (纸本)9781450351058

A notable class of techniques for automatic program repair is known as semantics-based. Such techniques, e.g., Angelix, infer semantic specifications via symbolic execution, and then use program synthesis to construct new code that satisfies those inferred specifications. However, the obtained specifications are naturally incomplete, leaving the synthesis engine with a difficult task of synthesizing a general solution from a sparse space of many possible solutions that are consistent with the provided specifications but that do not necessarily generalize. We present S3, a new repair synthesis engine that leverages programming-by-examples methodology to synthesize high-quality bug repairs. The novelty in S3 that allows it to tackle the sparse search space to create more general repairs is three-fold: (1) A systematic way to customize and constrain the syntactic search space via a domain-specific language, (2) An efficient enumeration-based search strategy over the constrained search space, and (3) A number of ranking features based on measures of the syntactic and semantic distances between candidate solutions and the original buggy program. We compare S3's repair effectiveness with state-of-the- art synthesis engines Angelix, Enumerative, and CVC4. S3 can successfully and correctly fix at least three times more bugs than the best baseline on datasets of 52 bugs in small programs, and 100 bugs in real-world large programs.

关键词： Program Repair programming by examples Inductive Synthesis Symbolic Execution

来源：评论

学校读者我要写书评

暂无评论

Towards Synthesis of Code for Calculations Using Their Specifications 18

Towards Synthesis of Code for Calculations Using Their Speci...

引用

18th International Conference on Evaluation of Novel Approaches to Software Engineering (ENASE)

作者： Datar, Advaita Zare, Amey Venkatesh, R. Asia, A. Tata Res Dev & Design Ctr TRDDC TCS Res Pune Maharashtra India

ISBN: (纸本)9789897586477

Banking, Financial Services, and Insurance (BFSI) software are calculation intensive. In general, these calculations are formally specified in spreadsheets, known as Calculation Specification (CS) sheets. CS sheets describe the calculation inputs and the business logic applied on these inputs to compute calculation output(s). Additionally, an illustration of the calculation is provided with at least one valid value for each calculation input. However, manual implementation of code corresponding to such CS sheets remains to be effort-intensive and tedious. This includes writing database queries to retrieve values for calculation inputs from the enterprise database and converting these queries and corresponding business logic to code. We propose a novel idea to synthesize code corresponding to CS sheets that will i) automatically identify the calculation inputs ii) formulate a programming By Example (PBE) specification for each calculation input where, PBE input is the textual description of the calculation input, PBE output is the valid value provided in the calculation's illustration, iii) then for each PBE specification a) synthesize a set of possible database queries, b) manually review them and mark the intended query, and finally iv) generate code, in desired target language, for all intended queries and the business logic specified in CS sheets.

关键词： Program Synthesis programming by examples Formal Specifications

来源：评论

学校读者我要写书评

暂无评论

EqFix: Fixing LATEX Equation Errors by examples 8th

EqFix: Fixing LATEX Equation Errors by Examples

引用

8th International Symposium on Dependable Software Engineering: Theories, Tools and Applications

作者： Zhu, Fengmin He, Fei Tsinghua Univ Sch Software Beijing Peoples R China MoE Key Lab Informat Syst Secur Beijing Peoples R China Beijing Natl Res Ctr Informat Sci & Technol Beijing Peoples R China Max Planck Inst Software Syst Saarbrucken Germany

ISBN: (纸本)9783031212123;9783031212130

LATEX is a widely-used document preparation system. Its powerful ability in mathematical equation editing is perhaps the main reason for its popularity in academia. Sometimes, however, even an expert user may spend much time fixing an erroneous equation. In this paper, we present EqFix, a synthesis-based repairing system for LATEX equations. It employs a set of fixing rules and can suggest possible repairs for common errors in LATEX equations. A domain-specific language is proposed for formally expressing the fixing rules. The fixing rules can be automatically synthesized from a set of input-output examples. An extension of relaxers is also introduced to enhance the practicality of EqFix. We evaluate EqFix on real-world examples and find that it can synthesize rules with high generalization ability. Compared with a state-of-the-art string transformation synthesizer, EqFix solved 37% more cases and spent less than half of their synthesis time.

关键词： Domain-specific languages Program synthesis Program repair programming by examples

来源：评论

学校读者我要写书评

暂无评论

Improving IDE Code Inspections with Tree Automata 2022

Improving IDE Code Inspections with Tree Automata

引用

30th ACM Joint European Software Engineering Conference / Symposium on the Foundations of Software Engineering (ESEC/FSE)

作者： Lee, Yunjeong Natl Univ Singapore Singapore Singapore

ISBN: (纸本)9781450394130

Integrated development environments (IDEs) are equipped with code inspections to warn developers of malformed or incorrect code by analyzing the code's data flow. However, the data flow analysis performed by the IDE code inspections may issue warnings in code where warnings are irrelevant. Existing methods to prevent any bogus warnings are either too conservative - suppressing the same type of warnings in the entire codebase - or are not sustainable as they require adding a set of heuristics to the data flow analysis. We propose a programming-by-example (PBE) framework that synthesizes tree automata (TAs) to suppress bogus warnings in all the code containing the same patterns as the user-provided examples. Experiments with a prototype of the framework demonstrate that several real-world patterns heuristically suppressed in production IDE can be mechanically translated to a TA in a systematic way. Furthermore, we briefly discuss how TA-based solution can be useful in other IDE features such as code refactoring.

关键词： code inspections tree automata programming by examples

来源：评论

学校读者我要写书评

暂无评论

Flexible Example-Based Program Synthesis on Tree-Structured Function Compositions

引用

SN Computer Science 2022年第3期3卷 1-15页

作者： Mucsányi, Bálint Gyarmathy, Bálint Czapp, Ádám Pintér, Balázs Faculty of Informatics ELTE Eötvös Loránd University Pázmány Péter sétány 1/C Budapest 1117 Hungary

We introduce a flexible program synthesis system whose task is to predict function compositions that transform given inputs to their corresponding given outputs. We process input lists in a sequential manner, allowing the system to generalize to a wide range of input lengths. We separate the operator and the operand in the lambda functions of the used higher order functions to achieve significantly wider numeric parameter ranges compared to the previous works. The evaluations show that this approach is competitive with state-of-the-art systems, while it is much more flexible in terms of the input length, the parameters of the lambda functions, and the integer range of the inputs and outputs. We extend the system to handle tree-structured function compositions by introducing two additional functions (zip_with, copy) and the ability to represent unfinished function compositions during the synthesis process. The extended system achieves state-of-the-art results while synthesizing complex function compositions with multiple forks. We believe that flexibility in these aspects is an important step towards solving real-world problems with example-based program synthesis. © 2022, The Author(s).

关键词： Beam search Gated recurrent unit Program synthesis programming by examples Recurrent neural network Tree-structured composition

来源：评论

学校读者我要写书评

暂无评论

Neural-Guided Inductive Synthesis of Functional Programs on List Manipulation by Offline Supervised Learning

引用

IEEE ACCESS 2021年 9卷 71521-71534页

作者： Wang, Yuhong Li, Xin East China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai 200062 Peoples R China

Synthesizing intended programs from user-specified input-output examples, also known as programming by examples (PBE), is a challenging problem in program synthesis, and has been applied to a wide range of domains. A key challenge in PBE is to efficiently discover a user-intended program in the search space that can be exponentially large. In this work, we propose a method for automatic synthesis of functional programs on list manipulation, by using offline-trained Recurrent Neural Network (RNN) models to guide the program search. We adopt miniKanren, an embedded domain-specific language for flexible relational programming, as an underlying top-down deductive search engine of candidate programs that are consistent with input-output examples. Our approach targets an easy and effective integration of deep learning techniques in making better PBE systems and combines two technical ideas on generating diverse training dataset and designing rich feature embeddings of probable subproblems for synthesis generated by deductive search. The offline-learned model is then used in PBE to guide the top-down deductive search with specific strategies. To practically manipulate data structures of lists, our method synthesizes functional programs with popular higher-order combinators including map, foldl and foldr. We have implemented our method and evaluated it with challenging program synthesis tasks on list manipulation. The experiments show promising results on the performance of our method compared to related state-of-the-art inductive synthesizers.

关键词： Training Task analysis programming Supervised learning Reactive power Automobiles Search engines programming by examples functional programs miniKanren relational programming deep learning deductive search

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Relation-Aware Entity Transformation by examples 18

Synthesizing Relation-Aware Entity Transformation by Example...

引用

40th ACM/IEEE International Conference on Software Engineering (ICSE)

作者： Wu, Jiarong Jiang, Yanyan Xu, Chang Cheung, Shing-Chi Ma, Xiaoxing Lu, Jian Nanjing Univ Nanjing Jiangsu Peoples R China Hong Kong Univ Sci & Technol Hong Kong Peoples R China

ISBN: (纸本)9781450356633

Recently, programming by examples (PBE) technique achieves a great success in processing and transforming data entities, yet existing approaches generally fall short on the tasks concerning entity relations. This paper presents ENTER, a domain-agnostic language for relation-aware entity transformation synthesis. It leverages the combination of two basic relations, the equivalence relation and the total order relation, to succinctly express complex entity relations. ENTER can be instantiated with domain-specific elements to solve a wide range of entity transformation tasks.

关键词： Program Synthesis programming by examples Data Transformation

来源：评论

学校读者我要写书评

暂无评论

Inference of Regular Expressions for Text Extraction from examples

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2016年第5期28卷 1217-1230页

作者： Bartoli, Alberto De Lorenzo, Andrea Medvet, Eric Tarlao, Fabiano Univ Trieste Dept Engn & Architecture DIA I-34127 Trieste Italy

A large class of entity extraction tasks from text that is either semistructured or fully unstructured may be addressed by regular expressions, because in many practical cases the relevant entities follow an underlying syntactical pattern and this pattern may be described by a regular expression. In this work, we consider the long-standing problem of synthesizing such expressions automatically, based solely on examples of the desired behavior. We present the design and implementation of a system capable of addressing extraction tasks of realistic complexity. Our system is based on an evolutionary procedure carefully tailored to the specific needs of regular expression generation by examples. The procedure executes a search driven by a multiobjective optimization strategy aimed at simultaneously improving multiple performance indexes of candidate solutions while at the same time ensuring an adequate exploration of the huge solution space. We assess our proposal experimentally in great depth, on a number of challenging datasets. The accuracy of the obtained solutions seems to be adequate for practical usage and improves over earlier proposals significantly. Most importantly, our results are highly competitive even with respect to human operators.

关键词： Genetic programming information extraction programming by examples multiobjective optimization heuristic search

来源：评论

学校读者我要写书评

暂无评论

Automating Repetitive Code Changes using examples 24

Automating Repetitive Code Changes using Examples

引用

24th ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE)

作者： Rolim, Reudismam Univ Fed Campina Grande Campina Grande Brazil

ISBN: (纸本)9781450342186

While adding features, fixing bugs, or refactoring the code, developers may perform repetitive code edits. Although Integrated Development Environments (IDEs) automate some transformations such as renaming, many repetitive edits are performed manually, which is error-prone and time-consuming. To help developers to apply these edits, we propose a technique to perform repetitive edits using examples. The technique receives as input the source code before and after the developer edits some target locations of the change and produces as output the top-ranked program transformation that can be applied to edit the remaining target locations in the codebase. The technique uses a state-of-the-art program synthesis methodology and has three main components: a) a DSL for describing program transformations;b) synthesis algorithms to learn program transformations in this DSL;c) ranking algorithms to select the program transformation with the higher probability of performing the desired repetitive edit. In our preliminary evaluation, in a dataset of 59 repetitive edit cases taken from real C# source code repositories, the technique performed, in 83% of the cases, the intended transformation using only 2.8 examples.

关键词： Program synthesis programming by examples Software evolution

来源：评论

学校读者我要写书评

暂无评论

Transforming Spreadsheet Data Types using examples 16

Transforming Spreadsheet Data Types using Examples

引用

43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages (POPL)

作者： Singh, Rishabh Gulwani, Sumit Microsoft Res Redmond WA USA

ISBN: (纸本)9781450335492

Cleaning spreadsheet data types is a common problem faced by millions of spreadsheet users. Data types such as date, time, name, and units are ubiquitous in spreadsheets, and cleaning transformations on these data types involve parsing and pretty printing their string representations. This presents many challenges to users because cleaning such data requires some background knowledge about the data itself and moreover this data is typically non-uniform, unstructured, and ambiguous. Spreadsheet systems and programming Languages provide some UI-based and programmatic solutions for this problem but they are either insufficient for the user's needs or are beyond their expertise. In this paper, we present a programming by example methodology of cleaning data types that learns the desired transformation from a few input-output examples. We propose a domain specific language with probabilistic semantics that is parameterized with declarative data type definitions. The probabilistic semantics is based on three key aspects: (i) approximate predicate matching, (ii) joint learning of data type interpretation, and (iii) weighted branches. This probabilistic semantics enables the language to handle non-uniform, unstructured, and ambiguous data. We then present a synthesis algorithm that learns the desired program in this language from a set of input-output examples. We have implemented our algorithm as an Excel add-in and present its successful evaluation on 55 benchmark problems obtained from online help forums and Excel product team.

关键词： Algorithms Human Factor Program Synthesis Probabilistic Synthesis Spreadsheet programming programming by examples Noisy examples

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：