{"id":"https://openalex.org/W3185895498","doi":"https://doi.org/10.1007/978-3-030-81685-8_39","title":"Counterexample-Guided Partial Bounding for Recursive Function Synthesis","display_name":"Counterexample-Guided Partial Bounding for Recursive Function Synthesis","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3185895498","doi":"https://doi.org/10.1007/978-3-030-81685-8_39","mag":"3185895498"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-81685-8_39","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-81685-8_39","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-81685-8_39.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-81685-8_39.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016276143","display_name":"Azadeh Farzan","orcid":"https://orcid.org/0000-0001-9005-2653"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Azadeh Farzan","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005233952","display_name":"Victor Nicolet","orcid":"https://orcid.org/0000-0002-3743-7498"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Victor Nicolet","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5016276143"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":5.0427,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.9652333,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"832","last_page":"855"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.8902682065963745},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7729470133781433},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.6604269742965698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6537914276123047},{"id":"https://openalex.org/keywords/\u03bc-operator","display_name":"\u03bc operator","score":0.6160621047019958},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5573861002922058},{"id":"https://openalex.org/keywords/primitive-recursive-function","display_name":"Primitive recursive function","score":0.5233737230300903},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48648709058761597},{"id":"https://openalex.org/keywords/recursive-functions","display_name":"Recursive functions","score":0.4681292772293091},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4426407217979431},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4272055923938751},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38987407088279724},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26043522357940674},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.24996435642242432},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07844522595405579}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8902682065963745},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7729470133781433},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6604269742965698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6537914276123047},{"id":"https://openalex.org/C85955891","wikidata":"https://www.wikidata.org/wiki/Q307772","display_name":"\u03bc operator","level":3,"score":0.6160621047019958},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5573861002922058},{"id":"https://openalex.org/C9986523","wikidata":"https://www.wikidata.org/wiki/Q1570472","display_name":"Primitive recursive function","level":2,"score":0.5233737230300903},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48648709058761597},{"id":"https://openalex.org/C2982939207","wikidata":"https://www.wikidata.org/wiki/Q1175101","display_name":"Recursive functions","level":2,"score":0.4681292772293091},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4426407217979431},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4272055923938751},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38987407088279724},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26043522357940674},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24996435642242432},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07844522595405579},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-81685-8_39","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-81685-8_39","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-81685-8_39.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-81685-8_39","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-81685-8_39","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-030-81685-8_39.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3185895498.pdf","grobid_xml":"https://content.openalex.org/works/W3185895498.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W1480909796","https://openalex.org/W1520171143","https://openalex.org/W1526922602","https://openalex.org/W1858945639","https://openalex.org/W1905591175","https://openalex.org/W1912569824","https://openalex.org/W1974514467","https://openalex.org/W1994090338","https://openalex.org/W2013596093","https://openalex.org/W2023299380","https://openalex.org/W2040345331","https://openalex.org/W2071164478","https://openalex.org/W2076242896","https://openalex.org/W2091385303","https://openalex.org/W2093535699","https://openalex.org/W2094878426","https://openalex.org/W2122384298","https://openalex.org/W2141505892","https://openalex.org/W2144936864","https://openalex.org/W2149236697","https://openalex.org/W2149335820","https://openalex.org/W2169417140","https://openalex.org/W2169495717","https://openalex.org/W2263738566","https://openalex.org/W2293033107","https://openalex.org/W2536320597","https://openalex.org/W2541300205","https://openalex.org/W2598582440","https://openalex.org/W2626245353","https://openalex.org/W2626931523","https://openalex.org/W2755587846","https://openalex.org/W2785559831","https://openalex.org/W2915687040","https://openalex.org/W2917906087","https://openalex.org/W2974174239","https://openalex.org/W3098585900","https://openalex.org/W4246691913","https://openalex.org/W4252251463"],"related_works":["https://openalex.org/W1596057910","https://openalex.org/W2368379187","https://openalex.org/W4239583161","https://openalex.org/W2055746193","https://openalex.org/W252215219","https://openalex.org/W3102439663","https://openalex.org/W1589207578","https://openalex.org/W4239039951","https://openalex.org/W2147242574","https://openalex.org/W4251662928"],"abstract_inverted_index":{"Abstract":[0],"Quantifier":[1],"bounding":[2,23,128],"is":[3,39,54,68,81],"a":[4,48,57,86,95,110],"standard":[5,126],"approach":[6],"in":[7,11,119],"inductive":[8],"program":[9],"synthesis":[10,27,37],"dealing":[12],"with":[13],"unbounded":[14],"domains.":[15],"In":[16,74],"this":[17,75],"paper,":[18],"we":[19,77],"propose":[20],"one":[21],"such":[22],"method":[24],"for":[25],"the":[26,62,71,89],"of":[28,88,106,113],"recursive":[29,32,58,123],"functions":[30,124],"over":[31],"input":[33,43,63],"data":[34],"types.":[35],"The":[36,52,98,104],"problem":[38],"specified":[40,69],"by":[41,70,94,102],"an":[42],"reference":[44],"(recursive)":[45],"function":[46,59,64],"and":[47],"recursion":[49,66,72],"skeleton":[50],".":[51],"goal":[53],"to":[55,61,83],"synthesize":[56],"equivalent":[60],"whose":[65],"strategy":[67,108],"skeleton.":[73],"context,":[76],"illustrate":[78],"that":[79,116],"it":[80,117],"possible":[82],"selectively":[84],"bound":[85],"subset":[87],"(recursively":[90],"typed)":[91],"parameters,":[92],"each":[93],"suitable":[96],"bound.":[97],"choices":[99],"are":[100],"guided":[101],"counterexamples.":[103],"evaluation":[105],"our":[107],"on":[109],"broad":[111],"set":[112],"benchmarks":[114],"shows":[115],"succeeds":[118],"efficiently":[120],"synthesizing":[121],"non-trivial":[122],"where":[125],"across-the-board":[127],"would":[129],"fail.":[130]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}