Synthesizing Transformations on Hierarchically Structured Data
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.
Thu 16 Jun Times are displayed in time zone: Tijuana, Baja California change
17:00 - 18:00
|Synthesizing Transformations on Hierarchically Structured Data|
Navid YaghmazadehUniversity of Texas, Austin, Christian KlingerUniversity of Texas, Austin, Isil DilligUniversity of Texas, Austin, Swarat ChaudhuriRice UniversityMedia Attached
|Program Synthesis from Polymorphic Refinement Types|
Research PapersMedia Attached