Efficient Program Synthesis via Anti-Unification

Enhancing Domain-Specific Language-Based Synthesis by Identifying and Utilizing Common Patterns

Bachelor thesis (2024)

Authors

R. Nicolae Electrical Engineering, Mathematics and Computer Science

Contributors

Sebastijan Dumancic Algorithmics (mentor)
R.J. Gardos Reid Algorithmics (mentor)
S.S. Chakraborty Programming Languages (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
More Info
expand_more

Published Date

21-06-2024

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Abstract

Program synthesis is the process of constructing programs that provably satisfy a given high-level user specification. Recent work in this domain has focused on utilizing domain-specific languages to guide the search procedure. This study proposes a novel approach to enhance the efficiency of such search procedures. By utilizing anti-unification, which is the process of generating the least general pattern between two symbolic expressions, this work aims to find common sub-components to enhance the language used in program synthesis to reduce search depth and improve performance.

Files

Research_paper_final.pdf
(pdf | 0.247 Mb)
Unknown license