<div class="csl-bib-body">
<div class="csl-entry">Hajdu, M., Hozzová, P., Kovács, L., Voronkov, A., Wagner, E. M., & Žilinčík, R. S. (2025). Synthesis Benchmarks for Automated Reasoning. In V. de Paiva & P. Koepke (Eds.), <i>Intelligent Computer Mathematics [CICM 2025]</i> (pp. 21–28). Springer Nature Link. https://doi.org/10.1007/978-3-032-07021-0_2</div>
</div>
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/221409
-
dc.description.abstract
Program synthesis is the task of constructing a program conforming to a given specification. We focus on deductive synthesis, and in particular on synthesis problems with specifications given as ∀∃-formulas, expressing the existence of an output corresponding to any input. So far there has been no canonical benchmark set for deductive synthesis using the ∀∃-format and supporting the so-called uncomputable symbol restriction. This work presents such a data set, composed by complementing existing benchmarks by new ones. Our data set is dynamically growing and should motivate future developments in the theory and practice of automating synthesis.
en
dc.description.sponsorship
European Commission
-
dc.description.sponsorship
FWF - Österr. Wissenschaftsfonds
-
dc.description.sponsorship
WWTF Wiener Wissenschafts-, Forschu und Technologiefonds
-
dc.language.iso
en
-
dc.relation.ispartofseries
Lecture notes in computer science
-
dc.rights.uri
http://creativecommons.org/licenses/by/4.0/
-
dc.subject
Automated Reasoning
en
dc.subject
Induction
en
dc.subject
Recursion
en
dc.subject
Synthesis
en
dc.title
Synthesis Benchmarks for Automated Reasoning
en
dc.type
Inproceedings
en
dc.type
Konferenzbeitrag
de
dc.rights.license
Creative Commons Namensnennung 4.0 International
de
dc.rights.license
Creative Commons Attribution 4.0 International
en
dc.contributor.affiliation
Czech Technical University in Prague, Czechia
-
dc.contributor.affiliation
University of Manchester, United Kingdom of Great Britain and Northern Ireland (the)
