{"id":"https://openalex.org/W4410583460","doi":"https://doi.org/10.23919/date64628.2025.10992799","title":"Polynomial Formal Verification of Sequential Circuits Using Weighted-AIGs","display_name":"Polynomial Formal Verification of Sequential Circuits Using Weighted-AIGs","publication_year":2025,"publication_date":"2025-03-31","ids":{"openalex":"https://openalex.org/W4410583460","doi":"https://doi.org/10.23919/date64628.2025.10992799"},"language":"en","primary_location":{"id":"doi:10.23919/date64628.2025.10992799","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date64628.2025.10992799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Design, Automation & Test in Europe Conference (DATE)","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/A5047269650","display_name":"Mohamed Nadeem","orcid":"https://orcid.org/0000-0002-0835-1070"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Mohamed Nadeem","raw_affiliation_strings":["University of Bremen,Bremen,Germany"],"affiliations":[{"raw_affiliation_string":"University of Bremen,Bremen,Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022866615","display_name":"Chandan Kumar Jha","orcid":"https://orcid.org/0000-0002-7237-5878"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Chandan Kumar Jha","raw_affiliation_strings":["University of Bremen,Bremen,Germany"],"affiliations":[{"raw_affiliation_string":"University of Bremen,Bremen,Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071742136","display_name":"Rolf Drechsler","orcid":"https://orcid.org/0000-0002-9872-1740"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Drechsler","raw_affiliation_strings":["University of Bremen,Bremen,Germany"],"affiliations":[{"raw_affiliation_string":"University of Bremen,Bremen,Germany","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047269650"],"corresponding_institution_ids":["https://openalex.org/I180437899"],"apc_list":null,"apc_paid":null,"fwci":4.9784,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.95152454,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9944999814033508,"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.9944999814033508,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9944000244140625,"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"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9789000153541565,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.5771704912185669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5522432923316956},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5500853061676025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4180350601673126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4097048342227936},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06925401091575623}],"concepts":[{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.5771704912185669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5522432923316956},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5500853061676025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4180350601673126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4097048342227936},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06925401091575623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/date64628.2025.10992799","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date64628.2025.10992799","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Design, Automation & Test in Europe Conference (DATE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3258253648","display_name":null,"funder_award_id":"DR 287/36-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W67485690","https://openalex.org/W341824072","https://openalex.org/W1017443791","https://openalex.org/W1484403583","https://openalex.org/W1587191403","https://openalex.org/W1606891084","https://openalex.org/W1639901403","https://openalex.org/W1970598347","https://openalex.org/W1971332020","https://openalex.org/W2049791401","https://openalex.org/W2076698873","https://openalex.org/W2091138122","https://openalex.org/W2097333141","https://openalex.org/W2100465945","https://openalex.org/W2117189826","https://openalex.org/W2152131859","https://openalex.org/W2295576379","https://openalex.org/W2611415697","https://openalex.org/W3150268867","https://openalex.org/W3162314170","https://openalex.org/W4211177236","https://openalex.org/W4223429781","https://openalex.org/W4229450561","https://openalex.org/W4241233758","https://openalex.org/W4242741415","https://openalex.org/W4245525634","https://openalex.org/W4245608944","https://openalex.org/W4293023328","https://openalex.org/W4399886033","https://openalex.org/W4401568139","https://openalex.org/W4401568242","https://openalex.org/W6704599368","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2051487156","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596"],"abstract_inverted_index":{"Ensuring":[0],"the":[1,14,48,79,153],"functional":[2],"correctness":[3],"of":[4,17,78,158],"a":[5,28,43,62,93,112,137,141,156],"digital":[6,83],"system":[7],"is":[8],"achievable":[9],"through":[10],"formal":[11,20,96,123],"verification.":[12,52],"Despite":[13],"increased":[15],"complexity":[16],"modern":[18],"systems,":[19],"verification":[21,97,124],"still":[22],"needs":[23],"to":[24,169],"be":[25,66],"done":[26],"in":[27,68,82,88,140],"reasonable":[29],"time.":[30,143],"Hence,":[31,87],"Polynomial":[32],"Formal":[33],"Verification":[34],"(PFV)":[35],"techniques":[36],"are":[37,85],"being":[38],"explored":[39],"as":[40],"they":[41],"provide":[42],"guaranteed":[44],"upper":[45],"bound":[46],"on":[47,155],"run":[49],"time":[50,70,95],"for":[51,101],"Recently,":[53],"it":[54],"was":[55],"shown":[56],"that":[57,128],"combinational":[58],"circuits":[59,103,160],"characterized":[60],"by":[61,110],"constant":[63,105,138],"cutwidth":[64,139],"can":[65,131],"verified":[67],"linear":[69,94,142],"using":[71,99],"Answer":[72],"Set":[73],"Programming":[74],"(ASP).":[75],"However,":[76],"most":[77],"designs":[80],"used":[81],"systems":[84],"sequential.":[86],"this":[89,109],"paper,":[90],"we":[91,126,145],"propose":[92],"approach":[98,130,149],"ASP":[100],"sequential":[102,134,159],"with":[104,136],"cutwidth.":[106],"We":[107],"achieve":[108],"proposing":[111],"new":[113],"data":[114],"structure":[115],"called":[116],"Weighted-And":[117],"Inverter":[118],"Graph":[119],"(W-AIG).":[120],"Unlike":[121],"existing":[122],"methods,":[125],"prove":[127],"our":[129,148,171],"verify":[132],"any":[133],"circuit":[135],"Finally,":[144],"also":[146],"implement":[147],"and":[150,166],"experimentally":[151],"show":[152],"results":[154],"variety":[157],"like":[161],"pipelined":[162],"adders,":[163,165],"serial":[164],"shift":[167],"registers":[168],"confirm":[170],"theoretical":[172],"findings.":[173]},"counts_by_year":[{"year":2025,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}