.png){kind=icon}
.png){kind=icon}
Return
Search-based Program Synthesis
.png){kind=icon}
PRE
AI
DOI：10.1145/3208071.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Writing programs that are both correct and efficient is challenging. A potential solution lies in program synthesis aimed at automatic derivation of an executable implementation (the how) from a high-level logical specification of the desired input-to-output behavior (the what). A mature synthesis technology can have a transformative impact on programmer productivity by liberating the programmer from low-level coding details. For instance, for the classical computational problem of sorting a list of numbers, the programmer has to simply specify that given an input array A of n numbers, compute an output array B consisting of exactly the same numbers as A such that B[i] <= B[i + 1] for 1 <= i < n, leaving it to the synthesizer to figure out the sequence of steps needed for the desired computation. Traditionally, program synthesis is formalized as a problem in deductive theorem proving: 17 A program is derived from the constructive proof of the theorem
Keywords:
SATISFIABILITY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12.2
Papers:
1.2W
Citations:
3.7W
View more organizations