{"id":"https://openalex.org/W2123184721","doi":"https://doi.org/10.1109/hldvt.2005.1568813","title":"VERISEC: VERIfying equivalence of SEquential Circuits using SAT","display_name":"VERISEC: VERIfying equivalence of SEquential Circuits using SAT","publication_year":2006,"publication_date":"2006-01-18","ids":{"openalex":"https://openalex.org/W2123184721","doi":"https://doi.org/10.1109/hldvt.2005.1568813","mag":"2123184721"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2005.1568813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2005.1568813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Tenth IEEE International High-Level Design Validation and Test Workshop, 2005.","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/A5003070855","display_name":"M. Syal","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Syal","raw_affiliation_strings":["Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA","[Bradley Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA]"],"affiliations":[{"raw_affiliation_string":"Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"[Bradley Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA]","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108516165","display_name":"Michael S. Hsiao","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.S. Hsiao","raw_affiliation_strings":["Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA","[Bradley Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA]"],"affiliations":[{"raw_affiliation_string":"Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"[Bradley Dept. of Electr. & Comput. Eng., Virginia Tech, Blacksburg, VA, USA]","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003070855"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":1.6351,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84145492,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":null,"first_page":"52","last_page":"59"},"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9969000220298767,"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/T12122","display_name":"Physical Unclonable Functions (PUFs) and Hardware Security","score":0.9952999949455261,"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/sequential-logic","display_name":"Sequential logic","score":0.7453250288963318},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.7125627994537354},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6358990669250488},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.5770657658576965},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5135610103607178},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5028297305107117},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.48776108026504517},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.48653069138526917},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.44362515211105347},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.4138188064098358},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39631548523902893},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.39037302136421204},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3421805500984192},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3245403468608856},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.28375232219696045},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11855199933052063}],"concepts":[{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.7453250288963318},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7125627994537354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6358990669250488},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.5770657658576965},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5135610103607178},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5028297305107117},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.48776108026504517},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.48653069138526917},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.44362515211105347},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.4138188064098358},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39631548523902893},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.39037302136421204},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3421805500984192},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3245403468608856},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.28375232219696045},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11855199933052063},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hldvt.2005.1568813","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2005.1568813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Tenth IEEE International High-Level Design Validation and Test Workshop, 2005.","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":22,"referenced_works":["https://openalex.org/W1524329362","https://openalex.org/W1819209966","https://openalex.org/W1992006255","https://openalex.org/W2002125840","https://openalex.org/W2044560939","https://openalex.org/W2075959177","https://openalex.org/W2110123236","https://openalex.org/W2115780004","https://openalex.org/W2117928198","https://openalex.org/W2123736383","https://openalex.org/W2124667771","https://openalex.org/W2142785340","https://openalex.org/W2145785237","https://openalex.org/W2154382131","https://openalex.org/W2158754249","https://openalex.org/W2159099907","https://openalex.org/W2161215542","https://openalex.org/W4230009915","https://openalex.org/W4247089533","https://openalex.org/W4247585869","https://openalex.org/W4255400352","https://openalex.org/W6648194185"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W3151473321","https://openalex.org/W2060407451","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,31],"propose":[4],"a":[5,19,108,127,139],"framework":[6,101,166],"to":[7,86,110,129,142,154],"verify":[8,156],"equivalence":[9,56,113],"of":[10,36,48,54,92,116],"sequential":[11,27,50,55,93,117,131,158],"circuits":[12,94,118],"using":[13],"Boolean":[14],"satisfiability":[15],"(SAT).":[16],"We":[17,150],"tackle":[18],"problem":[20,35],"that":[21],"is":[22,77],"harder":[23],"than":[24],"the":[25,33,64,68,103,135,148],"traditional":[26],"hardware":[28],"equivalence;":[29],"specifically,":[30],"address":[32],"uninvestigated":[34],"verifying":[37,74,82],"delay":[38,75],"replaceability":[39,76,84],"as":[40,79,81,96],"stated":[41],"in":[42],"V.":[43,87],"Singhal":[44,88],"et":[45,89],"al.":[46,90],"(2001)":[47,91],"two":[49],"designs.":[51],"This":[52],"notion":[53],"does":[57],"not":[58],"make":[59,164],"any":[60,123],"assumptions":[61,121],"either":[62],"about":[63,67,122],"design-environment":[65],"or":[66],"design's":[69],"steady":[70],"state":[71],"behavior.":[72],"Thus,":[73],"considered":[78],"hard":[80],"safe":[83],"according":[85],"(conjectured":[95],"EXPSPACE":[97],"complete).":[98],"Our":[99],"SAT-based":[100],"has":[102],"following":[104],"salient":[105],"features:":[106],"(a)":[107],"methodology":[109],"inductively":[111],"prove":[112],"(delay":[114],"replaceability)":[115],"with":[119],"no":[120],"initial":[124],"state;":[125],"(b)":[126],"scheme":[128,141],"include":[130],"logic":[132],"implications":[133],"into":[134],"framework;":[136],"and":[137,168],"(c)":[138],"low-cost":[140],"identify":[143],"equivalent":[144],"flip-flop":[145],"pairs":[146],"on":[147],"fly.":[149],"used":[151],"our":[152,165],"tool":[153],"successfully":[155],"several":[157],"benchmark":[159],"circuits.":[160],"Low":[161],"execution":[162],"times":[163],"practical":[167],"scalable.":[169]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}