{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T10:48:03Z","timestamp":1776509283708,"version":"3.51.2"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032070203","type":"print"},{"value":"9783032070210","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:00:00Z","timestamp":1759881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"Abstract<\/jats:title>\n \n 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\n \n \n $$\\forall \\exists $$<\/jats:tex-math>\n \n \n \u2200<\/mml:mo>\n \u2203<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -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\n \n \n $$\\forall \\exists $$<\/jats:tex-math>\n \n \n \u2200<\/mml:mo>\n \u2203<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n -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.\n <\/jats:p>","DOI":"10.1007\/978-3-032-07021-0_2","type":"book-chapter","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T13:41:50Z","timestamp":1759844510000},"page":"21-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Synthesis Benchmarks for Automated Reasoning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8273-2613","authenticated-orcid":false,"given":"M\u00e1rton","family":"Hajdu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0845-5811","authenticated-orcid":false,"given":"Petra","family":"Hozzov\u00e1","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8299-2714","authenticated-orcid":false,"given":"Laura","family":"Kov\u00e1cs","sequence":"additional","affiliation":[]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3765-4130","authenticated-orcid":false,"given":"Eva Maria","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Richard Steven","family":"\u017dilin\u010d\u00edk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Alur, R., Fisman, D., Padhi, S., Reynolds, A., Singh, R., Udupa, A.: SyGuS-Comp 2019 (2019), https:\/\/sygus.org\/comp\/2019\/"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Barbosa, H., Barrett, C.W., Brain, M., Kremer, G., Lachnitt, H., Mann, M., Mohamed, A., Mohamed, M., Niemetz, A., N\u00f6tzli, A., Ozdemir, A., Preiner, M., Reynolds, A., Sheng, Y., Tinelli, C., Zohar, Y.: cvc5: A Versatile and Industrial-Strength SMT Solver. In: TACAS. pp. 415\u2013442 (2022). https:\/\/doi.org\/10.1007\/978-3-030-99524-9_24","DOI":"10.1007\/978-3-030-99524-9_24"},{"key":"2_CR3","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.7. Tech. rep., Department of Computer Science, The University of Iowa (2025), https:\/\/smt-lib.org\/papers\/smt-lib-reference-v2.7-r2025-02-05.pdf"},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"De\u00a0Moura, L., Bj\u00f8rner, N.: Z3: An Efficient SMT Solver. In: TACAS. LNCS, vol.\u00a04963, pp. 337\u2013340. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Einarsd\u00f3ttir, S.H., Hajdu, M., Johansson, M., Smallbone, N., Suda, M.: Lemma Discovery and Strategies for Automated Induction. In: IJCAR (2024).https:\/\/doi.org\/10.1007\/978-3-031-63498-7_13","DOI":"10.1007\/978-3-031-63498-7_13"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Gulwani, S., Polozov, O., Singh, R.: Program synthesis. Foundations and Trends\u00aein Programming Languages 4(1-2), 1\u2013119 (2017). https:\/\/doi.org\/10.1561\/2500000010","DOI":"10.1561\/2500000010"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Hozzov\u00e1, P., Amrollahi, D., Hajdu, M., Kov\u00e1cs, L., Voronkov, A., Wagner, E.M.: Synthesis of Recursive Programs in Saturation. In: Benzm\u00fcller, C., Heule, M.J., Schmidt, R.A. (eds.) Automated Reasoning. pp. 154\u2013171. Springer Nature Switzerland, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-63498-7_10","DOI":"10.1007\/978-3-031-63498-7_10"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Hozzov\u00e1, P., Kov\u00e1cs, L., Norman, C., Voronkov, A.: Program Synthesis in Saturation. In: CADE. pp. 307\u2013324 (2023). https:\/\/doi.org\/10.1007\/978-3-031-38499-8_18","DOI":"10.1007\/978-3-031-38499-8_18"},{"key":"2_CR9","unstructured":"Hozzov\u00e1, P., Bj\u00f8rner, N.: Synthesiz3 This: an SMT-Based Approach for Synthesis with Uncomputable Symbols (2025), https:\/\/arxiv.org\/abs\/2504.16536, to appear in proceedings of FMCAD 2025."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs, L., Voronkov, A.: First-Order Theorem Proving and Vampire. In: CAV. pp. 1\u201335 (2013)","DOI":"10.1007\/978-3-642-39799-8_1"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/357084.357090","volume":"2","author":"Z Manna","year":"1980","unstructured":"Manna, Z., Waldinger, R.: A Deductive Approach to Program Synthesis. ACM Trans. Program. Lang. Syst. 2(1), 90\u2013121 (1980). https:\/\/doi.org\/10.1145\/357084.357090","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/362566.362568","volume":"14","author":"Z Manna","year":"1971","unstructured":"Manna, Z., Waldinger, R.J.: Toward automatic program synthesis. Commun. ACM 14(3), 151\u2013165 (1971). https:\/\/doi.org\/10.1145\/362566.362568","journal-title":"Commun. ACM"},{"key":"2_CR13","unstructured":"Padhi, S., Polgreen, E., Raghothaman, M., Reynolds, A., Udupa, A.: The SyGuS Language Standard Version 2.1 (2021), https:\/\/sygus-org.github.io\/language\/"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/S10703-017-0270-2","volume":"55","author":"A Reynolds","year":"2019","unstructured":"Reynolds, A., Kuncak, V., Tinelli, C., Barrett, C.W., Deters, M.: Refutation-based synthesis in SMT. Formal Methods Syst. Des. 55(2), 73\u2013102 (2019). https:\/\/doi.org\/10.1007\/S10703-017-0270-2","journal-title":"Formal Methods Syst. Des."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07021-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T10:21:07Z","timestamp":1776507667000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07021-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032070203","9783032070210"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07021-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brasilia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2025\/cicm.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}