Machine learning for function synthesis

Thesis

Function synthesis is the process of automatically constructing functions that satisfy a given specification. The space of functions as well as the format of the specifications vary greatly with each area of application. In this thesis, we consider synthesis in the context of satisfiability modulo theories. Within this domain, the goal is to synthesise mathematical expressions that adhere to abstract logical formulas. These types of synthesis problems find many applications in the field of...

Expand abstract

Authors: Parsert, J

• DOI: 10.5287/ora-vjqkgexvy
• Type of award: DPhil
• Level of award: Doctoral
• Awarding institution: University of Oxford
• Language: English
• Keywords: program synthesis; syntax-guided synthesis; program analysis; function synthesis; reinforcement learning; machine learning; termination; computer-aided verification; logic; verification; satisfiability modulo theories; Monte-Carlo tree search
• Subjects: Program synthesis; Function synthesis; Machine learning; Synthesis; Verification (logic); Reinforcement learning; Computer software--verification; Computer programs--termination; Logic, symbolic and mathematical