CP
C.D.M. Preda
info
Please Note
<p>This page displays the records of the person named above and is not linked to a unique person identifier. This record may need to be merged to a profile.</p>
1 records found
1
A key problem in program synthesis is that the search space is too big to traverse without a tactic. Budgeted search, specifically the Probe algorithm, is a promising one. Unfortunately Probe is treated as a monolith, instead of a collection of design choices. We identify these choices in the Herb-Probe algorithm and implement it in a budgeted search framework. Through its evaluation we learn more about Probe's design and create a framework for easy budgeted search comparison and hybridization.
...
A key problem in program synthesis is that the search space is too big to traverse without a tactic. Budgeted search, specifically the Probe algorithm, is a promising one. Unfortunately Probe is treated as a monolith, instead of a collection of design choices. We identify these choices in the Herb-Probe algorithm and implement it in a budgeted search framework. Through its evaluation we learn more about Probe's design and create a framework for easy budgeted search comparison and hybridization.