Synthesizing transformations on hierarchically structured data

By Navid Yaghmazadeh, Christian Klinger, Işıl Dillig, Swarat Chaudhuri. 2016

59 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Information Systems, Code Generation & Program Synthesis

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Jacob Steinhardt
2. A. Aiken
3. Percy Liang
4. C. Jermaine
5. Kensen Shi
6. Swarat Chaudhuri

In Information Systems

1. Percy Liang
2. Panupong Pasupat
3. C. Jermaine
4. David Melski
5. Yanxin Lu
6. Swarat Chaudhuri
7. Kensen Shi
8. A. Aiken

In Code Generation & Program Synthesis

1. Swarat Chaudhuri
2. C. Jermaine
3. Percy Liang
4. David Melski
5. Yanxin Lu
6. A. Aiken
7. Kensen Shi
8. Oded Padon

Citations in the corpus

• SPoC: Search-based Pseudocode to Code (2019, background): “However, most synthesized programs are relatively short, and works that consistently synthesize longer programs are in the domains where the intermediate computation is easier to recover from input and output, such as string [11, 28, 6] and data structure transformations [10, 38].”
• FrAngel: component-based synthesis with control structures (2018, methodology): “Some approaches use specialized loops in a DSL [Gulwani 2011; Perelman et al. 2014] or looping components (e.g., map and filter operators) [Feng et al. 2017a; Feser et al. 2015; Harris and Gulwani 2011; Yaghmazadeh et al. 2016] to mitigate this issue in specific domains.”
• Data-Driven Program Completion (2017, methodology): “e problem of program synthesis has been considered for a long time (Alur et al. 2015a; Pnueli and Rosner 1989) and recently it has been successfully applied to domain-speci c tasks (Feng et al. 2016, 2017; Polozov and Gulwani 2015; Yaghmazadeh et al. 2016).”