{"id":"https://openalex.org/W4308575509","doi":"https://doi.org/10.1109/vlsi-soc54400.2022.9939650","title":"Preserving Design Hierarchy Information for Polynomial Formal Verification","display_name":"Preserving Design Hierarchy Information for Polynomial Formal Verification","publication_year":2022,"publication_date":"2022-10-03","ids":{"openalex":"https://openalex.org/W4308575509","doi":"https://doi.org/10.1109/vlsi-soc54400.2022.9939650"},"language":"en","primary_location":{"id":"doi:10.1109/vlsi-soc54400.2022.9939650","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vlsi-soc54400.2022.9939650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)","raw_type":"proceedings-article"},"type":"conference-paper","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/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,Institute of Computer Science,Bremen,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bremen,Institute of Computer Science,Bremen,Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061877015","display_name":"Alireza Mahzoon","orcid":"https://orcid.org/0000-0001-9342-1098"},"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":"Alireza Mahzoon","raw_affiliation_strings":["University of Bremen,Institute of Computer Science,Bremen,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bremen,Institute of Computer Science,Bremen,Germany","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I180437899"],"apc_list":null,"apc_paid":null,"fwci":1.1232,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76160991,"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":"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.9998000264167786,"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.9998000264167786,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9965000152587891,"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"}},{"id":"https://openalex.org/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.9962000250816345,"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/correctness","display_name":"Correctness","score":0.8280720114707947},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7853459119796753},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.6680063009262085},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5814128518104553},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5792700052261353},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5098727941513062},{"id":"https://openalex.org/keywords/functional-verification","display_name":"Functional verification","score":0.5028542876243591},{"id":"https://openalex.org/keywords/formal-methods","display_name":"Formal methods","score":0.4384402334690094},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4301171898841858},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.38438937067985535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3142344355583191},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.28930604457855225}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8280720114707947},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7853459119796753},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.6680063009262085},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5814128518104553},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5792700052261353},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5098727941513062},{"id":"https://openalex.org/C62460635","wikidata":"https://www.wikidata.org/wiki/Q5508853","display_name":"Functional verification","level":3,"score":0.5028542876243591},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.4384402334690094},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4301171898841858},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.38438937067985535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3142344355583191},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.28930604457855225},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vlsi-soc54400.2022.9939650","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vlsi-soc54400.2022.9939650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IFIP/IEEE 30th International Conference on Very Large Scale Integration (VLSI-SoC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1602476740","https://openalex.org/W2100465945","https://openalex.org/W2282171944","https://openalex.org/W2329849566","https://openalex.org/W2899780216","https://openalex.org/W2983688775","https://openalex.org/W3113354335","https://openalex.org/W3158190002","https://openalex.org/W3162314170","https://openalex.org/W3165204519","https://openalex.org/W3200277260","https://openalex.org/W3212814011","https://openalex.org/W4200440294","https://openalex.org/W4205522466","https://openalex.org/W4213246704","https://openalex.org/W4229452097","https://openalex.org/W4241530675","https://openalex.org/W4242633448","https://openalex.org/W4245015178","https://openalex.org/W4255413535","https://openalex.org/W4285176263","https://openalex.org/W4312956900","https://openalex.org/W4313496518","https://openalex.org/W4381329128","https://openalex.org/W6839374883","https://openalex.org/W6848588329","https://openalex.org/W6853739930"],"related_works":["https://openalex.org/W75359960","https://openalex.org/W3120172095","https://openalex.org/W2105593427","https://openalex.org/W2118572231","https://openalex.org/W2534958226","https://openalex.org/W1573022308","https://openalex.org/W2118549635","https://openalex.org/W2898126919","https://openalex.org/W76179479","https://openalex.org/W2112298791"],"abstract_inverted_index":{"With":[0],"the":[1,15,21,53,61,87,98,101,105,139,147,153,173,183,208,211],"growing":[2],"complexity":[3,71],"of":[4,23,100,117,141,150,155,175,185,210],"digital":[5,114],"circuits,":[6],"formal":[7,157],"verification":[8,28,54,127,149,174],"has":[9],"become":[10],"a":[11,24],"crucial":[12],"task":[13],"after":[14],"design":[16,106,189,204],"in":[17,33,60,78,81,129],"order":[18],"to":[19,43,51,97],"ensure":[20],"correctness":[22],"circuit.":[25],"Many":[26],"existing":[27],"methods":[29],"suffer":[30],"from":[31],"unpredictability":[32,64],"their":[34],"performance.":[35],"It":[36],"is":[37,108,191],"not":[38],"clear":[39],"whether":[40,57],"they":[41,58],"have":[42,92],"be":[44,67,122,200],"run":[45],"for":[46,111],"seconds,":[47],"hours,":[48],"or":[49,56],"days":[50],"return":[52],"results":[55],"fail":[59],"end.":[62],"The":[63],"can":[65,199],"only":[66],"resolved":[68],"by":[69,202],"ensuring":[70],"bounds.":[72],"To":[73],"guarantee":[74],"scalability":[75],"we":[76,163,194],"are":[77],"particular":[79],"interested":[80],"Polynomial":[82],"Formal":[83],"Verification":[84],"(PFV),":[85],"where":[86],"space":[88,131],"and":[89,132,152,167,181],"time":[90],"complexities":[91],"polynomial":[93,130],"bounds":[94],"with":[95,124,135],"respect":[96],"size":[99],"circuit.The":[102],"information":[103,206],"about":[104,138],"hierarchy":[107,190,205],"usually":[109],"vital":[110],"PFV.":[112],"Complex":[113],"circuits":[115,180],"consist":[116],"several":[118,176],"components":[119],"that":[120],"cannot":[121],"verified":[123],"an":[125],"individual":[126],"technique":[128],"time.":[133],"However,":[134],"additional":[136],"knowledge":[137],"boundaries":[140,209],"components,":[142],"PFV":[143,166,186],"becomes":[144],"possible":[145],"through":[146],"step-wise":[148],"sub-components":[151],"use":[154],"different":[156],"proof":[158],"engines.":[159],"In":[160],"this":[161],"paper,":[162],"first":[164],"introduce":[165],"clarify":[168],"its":[169],"importance.":[170],"We":[171],"consider":[172],"flattened":[177],"gate-level":[178],"arithmetic":[179],"illustrate":[182],"challenges":[184,198],"when":[187],"no":[188],"available.":[192],"Then,":[193],"show":[195],"how":[196],"these":[197],"overcome":[201],"preserving":[203],"including":[207],"components.":[212]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}