Connecting Program Synthesis and Reachability: Automatic Program Repair Using Test-Input Generation

ThanhVu Nguyen, Westley Weimer, Deepak Kapur, Stephanie Forrest

Abstract: We prove that certain formulations of program synthesis and reachability are equivalent. Specifically, our constructive proof shows the reductions between the template-based synthesis problem, which generates a program in a pre-specified form, and the reachability problem, which decides the reachability of a program location. This establishes a link between the two research fields and allows for the transfer of techniques and results between them.