{"id":"https://openalex.org/W4414978546","doi":"https://doi.org/10.1145/3763084","title":"Revamping Verilog Semantics for Foundational Verification","display_name":"Revamping Verilog Semantics for Foundational Verification","publication_year":2025,"publication_date":"2025-10-09","ids":{"openalex":"https://openalex.org/W4414978546","doi":"https://doi.org/10.1145/3763084"},"language":"en","primary_location":{"id":"doi:10.1145/3763084","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763084","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3763084","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","license_id":"https://openalex.org/licenses/cc-by","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://dl.acm.org/doi/pdf/10.1145/3763084","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003461001","display_name":"Joonwon Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I1311688040","display_name":"Amazon (United States)","ror":"https://ror.org/04mv4n011","country_code":"US","type":"company","lineage":["https://openalex.org/I1311688040"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joonwon Choi","raw_affiliation_strings":["Amazon Web Services, Seattle, USA"],"raw_orcid":"https://orcid.org/0000-0002-1084-881X","affiliations":[{"raw_affiliation_string":"Amazon Web Services, Seattle, USA","institution_ids":["https://openalex.org/I1311688040"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017534213","display_name":"Jaewoo Kim","orcid":"https://orcid.org/0009-0003-3800-9879"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jaewoo Kim","raw_affiliation_strings":["KAIST, Daejeon, Republic of Korea"],"raw_orcid":"https://orcid.org/0009-0003-3800-9879","affiliations":[{"raw_affiliation_string":"KAIST, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078763719","display_name":"Jeehoon Kang","orcid":"https://orcid.org/0000-0002-2115-0871"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jeehoon Kang","raw_affiliation_strings":["FuriosaAI, Seoul, Republic of Korea","KAIST, Daejeon, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0002-2115-0871","affiliations":[{"raw_affiliation_string":"FuriosaAI, Seoul, Republic of Korea","institution_ids":[]},{"raw_affiliation_string":"KAIST, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2236,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.85591842,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"9","issue":"OOPSLA2","first_page":"950","last_page":"977"},"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.9976000189781189,"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.9976000189781189,"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/T11424","display_name":"Security and Verification in Computing","score":0.9952999949455261,"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.9948999881744385,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6545000076293945},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.578499972820282},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5561000108718872},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5375999808311462},{"id":"https://openalex.org/keywords/verilog","display_name":"Verilog","score":0.5198000073432922},{"id":"https://openalex.org/keywords/functional-verification","display_name":"Functional verification","score":0.5130000114440918},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.4893999993801117},{"id":"https://openalex.org/keywords/formal-semantics","display_name":"Formal semantics (linguistics)","score":0.4724000096321106}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7803999781608582},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7445999979972839},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6545000076293945},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.578499972820282},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5561000108718872},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5375999808311462},{"id":"https://openalex.org/C2779030575","wikidata":"https://www.wikidata.org/wiki/Q827773","display_name":"Verilog","level":3,"score":0.5198000073432922},{"id":"https://openalex.org/C62460635","wikidata":"https://www.wikidata.org/wiki/Q5508853","display_name":"Functional verification","level":3,"score":0.5130000114440918},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.4893999993801117},{"id":"https://openalex.org/C146499914","wikidata":"https://www.wikidata.org/wiki/Q5469969","display_name":"Formal semantics (linguistics)","level":2,"score":0.4724000096321106},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.4634999930858612},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39660000801086426},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.37700000405311584},{"id":"https://openalex.org/C150607116","wikidata":"https://www.wikidata.org/wiki/Q4677421","display_name":"Action semantics","level":5,"score":0.36070001125335693},{"id":"https://openalex.org/C3406870","wikidata":"https://www.wikidata.org/wiki/Q6044160","display_name":"Intelligent verification","level":5,"score":0.34769999980926514},{"id":"https://openalex.org/C187250869","wikidata":"https://www.wikidata.org/wiki/Q5754573","display_name":"High-level verification","level":5,"score":0.32499998807907104},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.29820001125335693},{"id":"https://openalex.org/C33054407","wikidata":"https://www.wikidata.org/wiki/Q6504747","display_name":"Software verification","level":5,"score":0.2854999899864197},{"id":"https://openalex.org/C88482812","wikidata":"https://www.wikidata.org/wiki/Q6453666","display_name":"Modular programming","level":2,"score":0.28209999203681946},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C58041814","wikidata":"https://www.wikidata.org/wiki/Q792533","display_name":"Axiomatic semantics","level":5,"score":0.2639999985694885},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3763084","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763084","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3763084","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","license_id":"https://openalex.org/licenses/cc-by","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/3763084","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3763084","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3763084","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","license_id":"https://openalex.org/licenses/cc-by","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":[{"id":"https://openalex.org/G1951640958","display_name":null,"funder_award_id":"IITP-2025-RS-2020-II201795","funder_id":"https://openalex.org/F4320328359","funder_display_name":"Ministry of Science and ICT, South Korea"},{"id":"https://openalex.org/G4018656872","display_name":null,"funder_award_id":"IITP-2025-RS-2020-II201795","funder_id":"https://openalex.org/F4320335489","funder_display_name":"Institute for Information and Communications Technology Promotion"},{"id":"https://openalex.org/G5916346754","display_name":null,"funder_award_id":"RS-2024-00347786","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"},{"id":"https://openalex.org/G8441597283","display_name":null,"funder_award_id":"RS-2023-","funder_id":"https://openalex.org/F4320328359","funder_display_name":"Ministry of Science and ICT, South Korea"}],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320324891","display_name":"Iran Telecommunication Research Center","ror":"https://ror.org/01a3g2z22"},{"id":"https://openalex.org/F4320328359","display_name":"Ministry of Science and ICT, South Korea","ror":"https://ror.org/01wpjm123"},{"id":"https://openalex.org/F4320335489","display_name":"Institute for Information and Communications Technology Promotion","ror":"https://ror.org/01g0hqq23"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414978546.pdf","grobid_xml":"https://content.openalex.org/works/W4414978546.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W22388517","https://openalex.org/W240055707","https://openalex.org/W1989107966","https://openalex.org/W2050351395","https://openalex.org/W2117189826","https://openalex.org/W2119616711","https://openalex.org/W2146109362","https://openalex.org/W2147889335","https://openalex.org/W2279061002","https://openalex.org/W2603089173","https://openalex.org/W2725179571","https://openalex.org/W3032952463","https://openalex.org/W3165541793","https://openalex.org/W3186572156","https://openalex.org/W4238637948","https://openalex.org/W4239452029","https://openalex.org/W4242148922","https://openalex.org/W4247134305","https://openalex.org/W4252720313","https://openalex.org/W4256174583","https://openalex.org/W4289874386","https://openalex.org/W4298072213","https://openalex.org/W4388867283","https://openalex.org/W4392361663","https://openalex.org/W6890094913","https://openalex.org/W6965406729","https://openalex.org/W7077151805"],"related_works":[],"abstract_inverted_index":{"In":[0],"formal":[1],"hardware":[2],"verification,":[3,98],"particularly":[4],"for":[5,109],"Register-Transfer":[6],"Level":[7],"(RTL)":[8],"designs":[9],"in":[10,138],"Verilog,":[11],"model":[12],"checking":[13],"has":[14],"been":[15],"the":[16,105,114],"predominant":[17],"technique.":[18],"However,":[19],"it":[20],"suffers":[21],"from":[22],"state":[23],"explosion,":[24],"limited":[25],"expressive":[26,39],"power,":[27],"and":[28,41,57,93,130],"a":[29,46,72,120,124],"large":[30],"trusted":[31],"computing":[32],"base":[33],"(TCB).":[34],"Deductive":[35],"verification":[36,44,122],"offers":[37],"greater":[38],"power":[40],"enables":[42],"foundational":[43,97],"with":[45,119],"minimal":[47],"TCB.":[48],"Nevertheless,":[49],"Verilog\u2019s":[50],"standard":[51,106],"semantics,":[52],"characterized":[53],"by":[54],"its":[55,64],"nondeterministic":[56],"global":[58],"scheduling,":[59],"pose":[60],"significant":[61],"challenges":[62],"to":[63,77,88,104],"application.":[65],"To":[66],"address":[67],"these":[68],"challenges,":[69],"we":[70,99],"propose":[71],"new":[73],"Verilog":[74],"semantics":[75,82,102,108,118],"designed":[76],"facilitate":[78],"deductive":[79],"verification.":[80],"Our":[81],"is":[83],"based":[84],"on":[85],"least":[86],"fixpoints":[87],"enable":[89],"cycle-level":[90],"functional":[91,128],"evaluation":[92],"modular":[94,121],"reasoning.":[95],"For":[96],"prove":[100],"our":[101,117,134],"equivalent":[103],"scheduling":[107],"synthesizable":[110],"designs.":[111],"We":[112],"demonstrate":[113],"benefits":[115],"of":[116,123],"pipelined":[125],"RISC-V":[126],"processor\u2019s":[127],"correctness":[129],"progress":[131],"guarantees.":[132],"All":[133],"results":[135],"are":[136],"mechanized":[137],"Rocq.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}