Adaptive Concretization for Parallel Program Synthesis
Program synthesis tools work by searching for an implementation that satisfies a given specification. Two popular search strategies are symbolic search, which reduces synthesis to a formula passed to a SAT solver, and explicit search, which uses brute force or random search to find a solution. In th...
Glavni autori: | Jeon, Jinseong, Foster, Jeffrey S., Qiu, Xiaokang, Solar Lezama, Armando |
---|---|
Daljnji autori: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Članak |
Jezik: | en_US |
Izdano: |
Springer-Verlag
2017
|
Online pristup: | http://hdl.handle.net/1721.1/111033 https://orcid.org/0000-0001-9476-7349 https://orcid.org/0000-0001-7604-8252 |
Slični predmeti
-
JSketch: Sketching for Java
od: Jeon, Jinseong, i dr.
Izdano: (2017) -
Synthesizing framework models for symbolic execution
od: Jeon, Jinseong, i dr.
Izdano: (2016) -
Program synthesis with algebraic library specifications
od: Mariano, Benjamin, i dr.
Izdano: (2021) -
Program synthesis from polymorphic refinement types
od: Polikarpova, Nadezhda, i dr.
Izdano: (2017) -
Using Program Synthesis for Social Recommendations
od: Cheung, Alvin, i dr.
Izdano: (2012)