Print Email Facebook Twitter Evolving a Domain-Specific Language to Speed Up Program Synthesis Title Evolving a Domain-Specific Language to Speed Up Program Synthesis Author Tempelman, Philip (TU Delft Electrical Engineering, Mathematics and Computer Science) Contributor Dumančić, S. (mentor) Smaragdakis, G. (graduation committee) Degree granting institution Delft University of Technology Programme Computer Science and Engineering Project CSE3000 Research Project Date 2022-06-23 Abstract Program synthesis is used in various ways to automate repetitive tasks or to generate software automatically. Search-based program synthesis constitutes searching the space of candidate programs created from a given language. However, this form of program synthesis is very expensive in terms of computing power. By optimising the synthesiser’s parameters on certain tasks, program synthesis can be made more efficient on other similar tasks. One of these parameters is the domain-specific language. Using a genetic algorithm, an optimised language was evolved for three different domains. This resulted in unnecessary language predicates being phased out and commonly used structures being introduced as new language predicates. Overall, using these evolved languages made program synthesis faster for the tasks in all three domains. Subject inductive program synthesisevolving a languagegenetic algorithmpredicate inventionsynthesis search space To reference this document use: http://resolver.tudelft.nl/uuid:9248b8c5-d3e0-4270-a2c3-1e9bc4ad218b Part of collection Student theses Document type bachelor thesis Rights © 2022 Philip Tempelman Files PDF Philip_Tempelman_Paper_Ev ... thesis.pdf 404.71 KB Close viewer /islandora/object/uuid:9248b8c5-d3e0-4270-a2c3-1e9bc4ad218b/datastream/OBJ/view