{"id":"https://openalex.org/W2986598723","doi":"https://doi.org/10.23919/fmcad.2019.8894267","title":"Extending enumerative function synthesis via SMT-driven classification","display_name":"Extending enumerative function synthesis via SMT-driven classification","publication_year":2019,"publication_date":"2019-10-01","ids":{"openalex":"https://openalex.org/W2986598723","doi":"https://doi.org/10.23919/fmcad.2019.8894267","mag":"2986598723"},"language":"en","primary_location":{"id":"doi:10.23919/fmcad.2019.8894267","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2019.8894267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000310752","display_name":"Haniel Barbosa","orcid":"https://orcid.org/0000-0003-0188-2300"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haniel Barbosa","raw_affiliation_strings":["The University of Iowa, Iowa City, USA"],"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083954589","display_name":"Andrew Reynolds","orcid":"https://orcid.org/0000-0002-3529-8682"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Reynolds","raw_affiliation_strings":["The University of Iowa, Iowa City, USA"],"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054784931","display_name":"Daniel Larraz","orcid":"https://orcid.org/0000-0001-5305-7340"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Larraz","raw_affiliation_strings":["The University of Iowa, Iowa City, USA"],"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, USA","institution_ids":["https://openalex.org/I126307644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046830049","display_name":"Cesare Tinelli","orcid":"https://orcid.org/0000-0002-6726-775X"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Cesare Tinelli","raw_affiliation_strings":["The University of Iowa, Iowa City, USA"],"affiliations":[{"raw_affiliation_string":"The University of Iowa, Iowa City, USA","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5000310752"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":1.3579,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.83629017,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"212","last_page":"220"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7631638050079346},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.642346978187561},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.6421040296554565},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6142066717147827},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5116201043128967},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4571095108985901},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.44342225790023804},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.41518664360046387},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.38199982047080994},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3562895953655243},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16780897974967957}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7631638050079346},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.642346978187561},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.6421040296554565},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6142066717147827},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5116201043128967},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4571095108985901},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.44342225790023804},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.41518664360046387},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.38199982047080994},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3562895953655243},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16780897974967957},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/fmcad.2019.8894267","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2019.8894267","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W145069693","https://openalex.org/W1481397690","https://openalex.org/W1495266209","https://openalex.org/W1507894341","https://openalex.org/W1549166962","https://openalex.org/W1569137956","https://openalex.org/W1663973292","https://openalex.org/W1912569824","https://openalex.org/W2009086942","https://openalex.org/W2094878426","https://openalex.org/W2105505307","https://openalex.org/W2125415493","https://openalex.org/W2149236697","https://openalex.org/W2149706766","https://openalex.org/W2161159055","https://openalex.org/W2185676247","https://openalex.org/W2294628582","https://openalex.org/W2416392025","https://openalex.org/W2466191210","https://openalex.org/W2503425026","https://openalex.org/W2589084440","https://openalex.org/W2603456259","https://openalex.org/W2733411084","https://openalex.org/W2779005308","https://openalex.org/W2797067769","https://openalex.org/W2798628553","https://openalex.org/W2802858733","https://openalex.org/W2807992309","https://openalex.org/W2811385959","https://openalex.org/W2909616620","https://openalex.org/W2938468157","https://openalex.org/W2956992268","https://openalex.org/W3102469351","https://openalex.org/W3138459719","https://openalex.org/W4236137412","https://openalex.org/W4237412827","https://openalex.org/W4245234767","https://openalex.org/W6605943119","https://openalex.org/W6628836516","https://openalex.org/W6629648295","https://openalex.org/W6724475266","https://openalex.org/W6730054439","https://openalex.org/W6736223135","https://openalex.org/W6740808898","https://openalex.org/W6749899772"],"related_works":["https://openalex.org/W2045049461","https://openalex.org/W4381094582","https://openalex.org/W2349952486","https://openalex.org/W1978893398","https://openalex.org/W1489260687","https://openalex.org/W1977906818","https://openalex.org/W2369625323","https://openalex.org/W2364579609","https://openalex.org/W4318620547","https://openalex.org/W2583022676"],"abstract_inverted_index":{"Many":[0],"relevant":[1],"problems":[2],"in":[3,87,138],"formal":[4],"methods":[5],"can":[6],"be":[7],"tackled":[8],"using":[9],"enumerative":[10,16,47],"syntax-guided":[11],"synthesis":[12,27,140],"(SyGuS).":[13],"Algorithms":[14],"for":[15,46,93,103],"SyGuS":[17,123,145],"range":[18],"from":[19,125],"universally":[20],"applicable":[21],"techniques":[22,34],"based":[23,35,58,153],"on":[24,36,59,121],"counterexample-guided":[25],"inductive":[26],"(CEGIS),":[28],"to":[29,135,143],"more":[30],"scalable":[31],"but":[32],"specialized":[33],"divide":[37,60],"and":[38,61,81,96,118,147],"conquer.":[39],"This":[40],"paper":[41],"presents":[42],"a":[43,79],"novel":[44],"algorithm":[45,133],"SyGuS,":[48],"Unif":[49],"+":[50],"PI,":[51],"which":[52],"reaps":[53],"the":[54,88,94,115,131],"benefits":[55],"of":[56,71,90,114],"scalability":[57],"conquer":[62],"without":[63],"sacrificing":[64],"generality.":[65],"In":[66],"this":[67],"algorithm,":[68],"an":[69,72,82,112],"instance":[70],"SMT":[73],"solver":[74,117],"is":[75,148],"used":[76],"as":[77,111],"both":[78],"classifier":[80],"attribute":[83],"generator.":[84],"Logical":[85],"constraints":[86],"form":[89],"test":[91],"cases":[92],"function-to-synthesize":[95],"failed":[97],"classification":[98],"attempts":[99],"guide":[100],"its":[101],"search":[102],"new":[104,132],"candidate":[105],"solutions.":[106],"We":[107,128],"implement":[108],"our":[109],"approach":[110],"extension":[113],"CVC4SY":[116],"evaluate":[119],"it":[120],"standard":[122],"benchmarks":[124],"different":[126],"applications.":[127],"show":[129],"that":[130],"leads":[134],"significant":[136],"gains":[137],"invariant":[139],"with":[141,150],"respect":[142],"state-of-the-art":[144,151],"solvers,":[146],"competitive":[149],"k-induction":[152],"model":[154],"checking.":[155]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}