{"url":"/sota/program-synthesis-on-spoc-testw","task":{"name":"Program Synthesis","url":"/task/program-synthesis","note":null},"dataset":{"name":"SPoC TestW","url":"/dataset/spoc"},"category":"Computer Code","categories":["Computer Code","Reasoning"],"category_note":null,"description":"Program synthesis is the process of automatically generating a program or code snippet that satisfies a given specification or set of requirements. This can include generating code from a formal specification, a natural language description, or example inputs and outputs. The primary goal of program synthesis is to minimize human intervention in the coding process, reduce errors, and improve productivity.\r\n\r\nProgram synthesis often involves the use of advanced algorithms, artificial intelligence, and machine learning techniques to search the space of possible programs that meet the given constraints. This process can be guided by a variety of techniques, such as constraint solving, symbolic execution, and genetic algorithms.","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["Success rate @budget 100"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Success rate @budget 100":"higher"}},"counts":{"rows":2,"rows_with_code":2,"rows_with_paper_page":2,"rows_dated":2,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"DrRepair","metrics":{"Success rate @budget 100":"57.0"},"uses_additional_data":false,"paper_date":"2020-05-20","paper":"/paper/graph-based-self-supervised-program-repair","paper_url":"https://arxiv.org/abs/2005.10636v2","paper_title":"Graph-based, Self-Supervised Program Repair from Diagnostic Feedback","code":"https://github.com/michiyasunaga/DrRepair","n_code_links":2,"syntology":{"n_ran":4,"n_unverified":2,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":2,"model":"Multiclass localizer","metrics":{"Success rate @budget 100":"53.7"},"uses_additional_data":false,"paper_date":"2019-06-12","paper":"/paper/spoc-search-based-pseudocode-to-code","paper_url":"https://arxiv.org/abs/1906.04908v1","paper_title":"SPoC: Search-based Pseudocode to Code","code":"https://github.com/sumith1896/spoc","n_code_links":1,"syntology":null}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":1,"rows_with_any_sample_ran":1,"distinct_papers_with_graph_line":1,"distinct_papers_with_any_sample_ran":1,"samples_over_distinct_papers":{"n_ran":4,"n_unverified":2,"n_samples":6,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":4,"n_unverified":2,"n_samples":6,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}