Affiliation:
1. University of Texas at Austin, USA
2. University of Freiburg, Germany
3. Rice University, USA
Abstract
This paper presents a new approach for synthesizing transformations on tree-structured data, such as Unix directories and XML documents. We consider a general abstraction for such data, called hierarchical data trees (HDTs) and present a novel example-driven synthesis algorithm for HDT transformations. Our central insight is to reduce the problem of synthesizing tree transformers to the synthesis of list transformations that are applied to the paths of the tree. The synthesis problem over lists is solved using a new algorithm that combines SMT solving and decision tree learning. We have implemented our technique in a system called HADES and show that HADES can automatically synthesize a variety of interesting transformations collected from online forums.
Funder
National Science Foundation
Air Force Research Laboratory
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Recursive Program Synthesis using Paramorphisms;Proceedings of the ACM on Programming Languages;2024-06-20
2. Automated Translation of Functional Big Data Queries to SQL;Proceedings of the ACM on Programming Languages;2023-04-06
3. Deterministic Graph-Walking Program Mining;Advanced Data Mining and Applications;2022
4. Active Learning for Inference and Regeneration of Applications that Access Databases;ACM Transactions on Programming Languages and Systems;2021-02
5. Inductive program synthesis over noisy data;Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2020-11-07