{"id":"https://openalex.org/W4308575532","doi":"https://doi.org/10.1109/vlsi-soc54400.2022.9939646","title":"A Comparison of SAT-based and SMT-based Frameworks for X-value Combinational Equivalence Checking","display_name":"A Comparison of SAT-based and SMT-based Frameworks for X-value Combinational Equivalence Checking","publication_year":2022,"publication_date":"2022-10-03","ids":{"openalex":"https://openalex.org/W4308575532","doi":"https://doi.org/10.1109/vlsi-soc54400.2022.9939646"},"language":"en","primary_location":{"id":"doi:10.1109/vlsi-soc54400.2022.9939646","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vlsi-soc54400.2022.9939646","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":"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/A5032020935","display_name":"Raiyyan Malik","orcid":null},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Raiyyan Malik","raw_affiliation_strings":["Indraprastha Institute of Information Technology,Delhi","Indraprastha Institute of Information Technology, Delhi"],"affiliations":[{"raw_affiliation_string":"Indraprastha Institute of Information Technology,Delhi","institution_ids":["https://openalex.org/I119939252"]},{"raw_affiliation_string":"Indraprastha Institute of Information Technology, Delhi","institution_ids":["https://openalex.org/I119939252"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068535540","display_name":"Shubham Baunthiyal","orcid":null},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Shubham Baunthiyal","raw_affiliation_strings":["Indraprastha Institute of Information Technology,Delhi","Indraprastha Institute of Information Technology, Delhi"],"affiliations":[{"raw_affiliation_string":"Indraprastha Institute of Information Technology,Delhi","institution_ids":["https://openalex.org/I119939252"]},{"raw_affiliation_string":"Indraprastha Institute of Information Technology, Delhi","institution_ids":["https://openalex.org/I119939252"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100641557","display_name":"Puneet Kumar","orcid":"https://orcid.org/0000-0002-7978-1043"},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Puneet Kumar","raw_affiliation_strings":["Indraprastha Institute of Information Technology,Delhi","Indraprastha Institute of Information Technology, Delhi"],"affiliations":[{"raw_affiliation_string":"Indraprastha Institute of Information Technology,Delhi","institution_ids":["https://openalex.org/I119939252"]},{"raw_affiliation_string":"Indraprastha Institute of Information Technology, Delhi","institution_ids":["https://openalex.org/I119939252"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014649382","display_name":"J Srinath","orcid":null},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Srinath J","raw_affiliation_strings":["Indraprastha Institute of Information Technology,Delhi","Indraprastha Institute of Information Technology, Delhi"],"affiliations":[{"raw_affiliation_string":"Indraprastha Institute of Information Technology,Delhi","institution_ids":["https://openalex.org/I119939252"]},{"raw_affiliation_string":"Indraprastha Institute of Information Technology, Delhi","institution_ids":["https://openalex.org/I119939252"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026324323","display_name":"Sneh Saurabh","orcid":"https://orcid.org/0000-0002-0587-3391"},"institutions":[{"id":"https://openalex.org/I119939252","display_name":"Indraprastha Institute of Information Technology Delhi","ror":"https://ror.org/03vfp4g33","country_code":"IN","type":"education","lineage":["https://openalex.org/I119939252"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sneh Saurabh","raw_affiliation_strings":["Indraprastha Institute of Information Technology,Delhi","Indraprastha Institute of Information Technology, Delhi"],"affiliations":[{"raw_affiliation_string":"Indraprastha Institute of Information Technology,Delhi","institution_ids":["https://openalex.org/I119939252"]},{"raw_affiliation_string":"Indraprastha Institute of Information Technology, Delhi","institution_ids":["https://openalex.org/I119939252"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5032020935"],"corresponding_institution_ids":["https://openalex.org/I119939252"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1653385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9983000159263611,"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.9983000159263611,"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.9769999980926514,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.975600004196167,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.7793743014335632},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6615749001502991},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.6532925963401794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6420283913612366},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.6346969604492188},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6316249370574951},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.6289414763450623},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5122124552726746},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48441627621650696},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4797755181789398},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.4736420214176178},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.45710620284080505},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4536426067352295},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.44785362482070923},{"id":"https://openalex.org/keywords/logic-synthesis","display_name":"Logic synthesis","score":0.43730059266090393},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40161722898483276},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.2852869927883148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26012200117111206},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1918872594833374},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1458195149898529}],"concepts":[{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.7793743014335632},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6615749001502991},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.6532925963401794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6420283913612366},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.6346969604492188},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6316249370574951},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6289414763450623},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5122124552726746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48441627621650696},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4797755181789398},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.4736420214176178},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.45710620284080505},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4536426067352295},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.44785362482070923},{"id":"https://openalex.org/C157922185","wikidata":"https://www.wikidata.org/wiki/Q173198","display_name":"Logic synthesis","level":3,"score":0.43730059266090393},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40161722898483276},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.2852869927883148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26012200117111206},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1918872594833374},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1458195149898529},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vlsi-soc54400.2022.9939646","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vlsi-soc54400.2022.9939646","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W616429135","https://openalex.org/W1481397690","https://openalex.org/W1518705996","https://openalex.org/W1579437898","https://openalex.org/W1605798759","https://openalex.org/W2129487583","https://openalex.org/W2133527541","https://openalex.org/W2146110773","https://openalex.org/W3114720194","https://openalex.org/W4206439492","https://openalex.org/W4246691913","https://openalex.org/W4252089621"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W4285605366","https://openalex.org/W3150741540","https://openalex.org/W2118943303","https://openalex.org/W4253759203","https://openalex.org/W2085380335","https://openalex.org/W2363848182","https://openalex.org/W2249253838","https://openalex.org/W4381894531","https://openalex.org/W2158533859"],"abstract_inverted_index":{"X-value":[0,71,192],"combinational":[1,45],"equivalence":[2,31,46],"checking":[3,47],"(XCEC)":[4],"is":[5,28,125,141,184],"a":[6,33,118,129,142],"critical":[7,24],"problem":[8,62,115],"in":[9,26,32,136],"verifying":[10],"refinement-based":[11],"logic":[12,53],"optimizations":[13],"and":[14,110,158],"ensuring":[15],"the":[16,41,60,67,77,83,105,112,120,138,146,188],"correctness":[17],"of":[18,145],"low":[19],"power":[20],"design":[21],"methodologies.":[22],"The":[23,101],"challenge":[25],"XCEC":[27,61,96,124,157],"to":[29,50,81,91,108,154,167],"establish":[30],"dramatically":[34],"expanded":[35],"search":[36,79],"space.":[37],"We":[38,150],"can":[39],"modify":[40],"traditional":[42],"SAT-based":[43,131,156,189],"Boolean":[44],"(CEC)":[48],"methods":[49],"handle":[51],"X-valued":[52],"by":[54,97],"adding":[55],"an":[56,87,163,180],"extra":[57],"bit.":[58],"However,":[59],"becomes":[63],"more":[64,126],"challenging":[65],"when":[66],"two":[68],"models":[69],"are":[70],"equivalent":[72,193],"because":[73],"it":[74],"involves":[75],"considering":[76],"entire":[78],"space":[80],"prove":[82],"equivalence.":[84],"Therefore,":[85],"as":[86,162],"alternative,":[88],"we":[89,176],"propose":[90],"use":[92],"SMT-based":[93,121,169,182],"frameworks":[94],"for":[95,123,134,191],"devising":[98],"appropriate":[99],"transformations.":[100],"proposed":[102],"formulation":[103],"allows":[104],"SMT":[106],"solver":[107],"pre-process":[109],"simplify":[111],"encoded":[113],"satisfiability":[114],"internally.":[116],"As":[117],"result,":[119],"framework":[122],"efficient":[127],"than":[128,187],"pure":[130],"XCEC,":[132],"especially":[133],"cases":[135],"which":[137],"revised":[139],"model":[140],"valid":[143],"refinement":[144],"given":[147],"golden":[148],"model.":[149],"have":[151],"used":[152],"Cryptominisat5":[153,161],"implement":[155,168],"STP":[159],"(with":[160],"internal":[164],"SAT":[165],"solver)":[166],"XCEC.":[170],"Using":[171],"ICCAD":[172],"2020":[173],"benchmark":[174],"suite,":[175],"demonstrate":[177],"that,":[178],"on":[179],"average":[181],"approach":[183,190],"2.5\u00d7":[185],"faster":[186],"cases.":[194]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}