{"id":"https://openalex.org/W4403223345","doi":"https://doi.org/10.1145/3689715","title":"Automating Unrealizability Logic: Hoare-Style Proof Synthesis for Infinite Sets of Programs","display_name":"Automating Unrealizability Logic: Hoare-Style Proof Synthesis for Infinite Sets of Programs","publication_year":2024,"publication_date":"2024-10-08","ids":{"openalex":"https://openalex.org/W4403223345","doi":"https://doi.org/10.1145/3689715"},"language":"en","primary_location":{"id":"doi:10.1145/3689715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689715","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3689715","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079236277","display_name":"Shaan Nagy","orcid":"https://orcid.org/0000-0001-8015-5421"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shaan Nagy","raw_affiliation_strings":["University of Wisconsin-Madison, Madison, USA"],"raw_orcid":"https://orcid.org/0000-0001-8015-5421","affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100434598","display_name":"Jinwoo Kim","orcid":"https://orcid.org/0000-0002-3897-1828"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jinwoo Kim","raw_affiliation_strings":["Seoul National University, Seoul, South Korea"],"raw_orcid":"https://orcid.org/0000-0002-3897-1828","affiliations":[{"raw_affiliation_string":"Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066155126","display_name":"Thomas Reps","orcid":"https://orcid.org/0000-0002-5676-9949"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Reps","raw_affiliation_strings":["University of Wisconsin-Madison, Madison, USA"],"raw_orcid":"https://orcid.org/0000-0002-5676-9949","affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, Madison, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089920000","display_name":"Loris D\u2019Antoni","orcid":"https://orcid.org/0000-0001-9625-4037"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Loris D\u2019Antoni","raw_affiliation_strings":["University of California San Diego, San Diego, USA"],"raw_orcid":"https://orcid.org/0000-0001-9625-4037","affiliations":[{"raw_affiliation_string":"University of California San Diego, San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2778,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.62962557,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"8","issue":"OOPSLA2","first_page":"113","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976000189781189,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/hoare-logic","display_name":"Hoare logic","score":0.7318616509437561},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6985341310501099},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.581534743309021},{"id":"https://openalex.org/keywords/style","display_name":"Style (visual arts)","score":0.4808433949947357},{"id":"https://openalex.org/keywords/axiomatic-semantics","display_name":"Axiomatic semantics","score":0.48070579767227173},{"id":"https://openalex.org/keywords/separation-logic","display_name":"Separation logic","score":0.42555463314056396},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.06058669090270996},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.05848902463912964}],"concepts":[{"id":"https://openalex.org/C104949639","wikidata":"https://www.wikidata.org/wiki/Q1375924","display_name":"Hoare logic","level":3,"score":0.7318616509437561},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6985341310501099},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.581534743309021},{"id":"https://openalex.org/C2776445246","wikidata":"https://www.wikidata.org/wiki/Q1792644","display_name":"Style (visual arts)","level":2,"score":0.4808433949947357},{"id":"https://openalex.org/C58041814","wikidata":"https://www.wikidata.org/wiki/Q792533","display_name":"Axiomatic semantics","level":5,"score":0.48070579767227173},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.42555463314056396},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.06058669090270996},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.05848902463912964},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.0},{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3689715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689715","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3689715","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3689715","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W33001676","https://openalex.org/W145069693","https://openalex.org/W1970168990","https://openalex.org/W2068567986","https://openalex.org/W2094878426","https://openalex.org/W2626584434","https://openalex.org/W2798628553","https://openalex.org/W2884889320","https://openalex.org/W2898869867","https://openalex.org/W2961192361","https://openalex.org/W3014982512","https://openalex.org/W3020408162","https://openalex.org/W3080260123","https://openalex.org/W3103982831","https://openalex.org/W3118342063","https://openalex.org/W3124300503","https://openalex.org/W4225922019","https://openalex.org/W4229675450","https://openalex.org/W4281873108","https://openalex.org/W4309133681","https://openalex.org/W4387885566","https://openalex.org/W4391244619","https://openalex.org/W6967989245"],"related_works":["https://openalex.org/W2096553703","https://openalex.org/W2165970356","https://openalex.org/W183428347","https://openalex.org/W1013128375","https://openalex.org/W1864574667","https://openalex.org/W2117210984","https://openalex.org/W1536810838","https://openalex.org/W2479659155","https://openalex.org/W2120897738","https://openalex.org/W590274811"],"abstract_inverted_index":{"Automated":[0],"verification":[1,25,38,71,192,231,234],"of":[2,5,10,26,39,41,59,98,156,166,197],"all":[3],"members":[4],"a":[6,102,107,175],"(potentially":[7],"infinite)":[8],"set":[9],"programs":[11,42,99,205],"has":[12],"the":[13,88,141,154,164,195,218],"potential":[14],"to":[15,49,93,130,159],"be":[16,75],"useful":[17],"in":[18,24,45,77,133,174],"program":[19],"synthesis,":[20],"as":[21,23,87,148,237,239],"well":[22],"dynamically":[27],"loaded":[28],"code,":[29,31],"concurrent":[30],"and":[32,47,113,190],"language":[33],"properties.":[34],"Existing":[35],"techniques":[36],"for":[37],"sets":[40,58,97],"are":[43,242],"limited":[44],"scope":[46],"unable":[48],"create":[50],"or":[51,54],"use":[52,114],"interpretable":[53],"reusable":[55,115],"information":[56],"about":[57],"programs.":[60],"The":[61],"consequence":[62],"is":[63],"that":[64,73,110,125,181],"one":[65,70],"cannot":[66],"learn":[67],"anything":[68],"from":[69,163,245],"problem":[72,155,165],"can":[74,111,188,215,224],"used":[76],"another.":[78],"Unrealizability":[79],"Logic":[80],"(UL),":[81],"proposed":[82],"by":[83,101,170],"Kim":[84],"et":[85],"al.":[86],"first":[89,142],"Hoare-style":[90],"proof":[91,144,172],"system":[92],"prove":[94,191],"properties":[95],"over":[96],"(defined":[100],"regular":[103],"tree":[104],"grammar),":[105],"presents":[106],"theoretical":[108],"framework":[109],"express":[112,189],"insight.":[116],"In":[117,136,211],"particular,":[118],"UL":[119,143,161],"features":[120],"nonterminal":[121,168,186,220,228],"summaries":[122,132,169,229,241],"\u2014inductive":[123],"facts":[124],"characterize":[126],"recursive":[127],"nonterminals":[128],"(analogous":[129],"procedure":[131],"Hoare":[134],"logic).":[135],"this":[137],"work,":[138],"we":[139,152],"design":[140],"synthesis":[145],"algorithm,":[146],"implemented":[147],"Wuldo":[149,182,214,223],".":[150],"Specifically,":[151],"decouple":[153],"deciding":[157],"how":[158,202],"apply":[160],"rules":[162],"synthesizing/checking":[167],"computing":[171],"structure":[173],"fully":[176],"syntax-directed":[177],"fashion.":[178],"We":[179],"show":[180],",":[183],"when":[184,240],"provided":[185],"summaries,":[187],"problems":[193],"beyond":[194],"reach":[196],"existing":[198],"tools,":[199],"including":[200],"establishing":[201],"infinitely":[203,208],"many":[204,209],"behave":[206],"on":[207],"inputs.":[210],"some":[212],"cases,":[213],"even":[216],"synthesize":[217],"necessary":[219],"summaries.":[221],"Moreover,":[222],"reuse":[225],"previously":[226],"proven":[227,244],"across":[230],"queries,":[232],"making":[233],"1.96":[235],"times":[236],"fast":[238],"instead":[243],"scratch.":[246]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2024-10-09T00:00:00"}