{"id":"https://openalex.org/W1604839858","doi":"https://doi.org/10.1109/hldvt.2003.1252476","title":"Enhancing SAT-based equivalence checking with static logic implications","display_name":"Enhancing SAT-based equivalence checking with static logic implications","publication_year":2004,"publication_date":"2004-03-30","ids":{"openalex":"https://openalex.org/W1604839858","doi":"https://doi.org/10.1109/hldvt.2003.1252476","mag":"1604839858"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2003.1252476","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2003.1252476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth IEEE International High-Level Design Validation and Test Workshop","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/A5101598230","display_name":"Rajat Arora","orcid":"https://orcid.org/0000-0002-0491-8092"},"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":"R. Arora","raw_affiliation_strings":["Virginia Technology, Blacksburg, VA, USA","Virginia Tech, , Blacksburg, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Virginia Technology, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"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":["Virginia Technology, Blacksburg, VA, USA","Virginia Tech, , Blacksburg, VA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Virginia Technology, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Virginia Tech, , Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1249","issue":null,"first_page":"63","last_page":"68"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9922999739646912,"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/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.6564360857009888},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6505626440048218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6317711472511292},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.601240336894989},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5522570013999939},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5324082970619202},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5282249450683594},{"id":"https://openalex.org/keywords/combinational-logic","display_name":"Combinational logic","score":0.503757655620575},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4863796532154083},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.46272698044776917},{"id":"https://openalex.org/keywords/literal","display_name":"Literal (mathematical logic)","score":0.46051421761512756},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4586813747882843},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.45818132162094116},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4579763114452362},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3328065872192383},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.3073490858078003},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.29358306527137756},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23830294609069824},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23713898658752441},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.16620254516601562}],"concepts":[{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.6564360857009888},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6505626440048218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6317711472511292},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.601240336894989},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5522570013999939},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5324082970619202},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5282249450683594},{"id":"https://openalex.org/C81409106","wikidata":"https://www.wikidata.org/wiki/Q76505","display_name":"Combinational logic","level":3,"score":0.503757655620575},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4863796532154083},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.46272698044776917},{"id":"https://openalex.org/C2780882242","wikidata":"https://www.wikidata.org/wiki/Q14235582","display_name":"Literal (mathematical logic)","level":2,"score":0.46051421761512756},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4586813747882843},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.45818132162094116},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4579763114452362},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3328065872192383},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3073490858078003},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.29358306527137756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23830294609069824},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23713898658752441},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.16620254516601562}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hldvt.2003.1252476","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2003.1252476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Eighth IEEE International High-Level Design Validation and Test Workshop","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":28,"referenced_works":["https://openalex.org/W1511155470","https://openalex.org/W1787074469","https://openalex.org/W2044560939","https://openalex.org/W2075959177","https://openalex.org/W2111523115","https://openalex.org/W2114766961","https://openalex.org/W2115571162","https://openalex.org/W2115780004","https://openalex.org/W2129369779","https://openalex.org/W2135613306","https://openalex.org/W2137035823","https://openalex.org/W2142785340","https://openalex.org/W2145117664","https://openalex.org/W2149968564","https://openalex.org/W2160444875","https://openalex.org/W2162226695","https://openalex.org/W2167452021","https://openalex.org/W2533858263","https://openalex.org/W3045969830","https://openalex.org/W4234414781","https://openalex.org/W4237163049","https://openalex.org/W4243399171","https://openalex.org/W4243933347","https://openalex.org/W4247585869","https://openalex.org/W4251370346","https://openalex.org/W6630643794","https://openalex.org/W6679299262","https://openalex.org/W6684832841"],"related_works":["https://openalex.org/W2363848182","https://openalex.org/W3151473321","https://openalex.org/W2060407451","https://openalex.org/W3107131366","https://openalex.org/W2480084299","https://openalex.org/W1656268799","https://openalex.org/W2091617677","https://openalex.org/W2366877601","https://openalex.org/W1547422702","https://openalex.org/W2367407624"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,42],"novel":[3],"technique":[4],"to":[5,17,62],"improve":[6],"SAT-based":[7],"Combinational":[8],"Equivalence":[9],"Checking":[10],"(CEC)":[11],"by":[12],"statically":[13],"adding":[14],"meaningful":[15],"clauses":[16,59,69],"the":[18,22,31,35,63,71,78,83,97],"CNF":[19,65],"formula":[20],"of":[21,45,103],"miter":[23,36,64],"circuit.":[24],"A":[25],"fast":[26],"preprocessing":[27],"quickly":[28],"builds":[29],"up":[30],"implication":[32],"graph":[33],"for":[34],"circuit":[37],"under":[38],"verification,":[39],"resulting":[40],"in":[41],"large":[43],"set":[44],"direct,":[46],"indirect":[47],"and":[48,60,74],"extended":[49],"backward":[50],"implications.":[51],"The":[52],"non-trivial":[53],"implications":[54],"are":[55],"converted":[56],"into":[57],"two-literal":[58],"added":[61,68,98],"database.":[66],"These":[67],"constrain":[70],"search":[72],"space,":[73],"provide":[75],"correlation":[76],"among":[77],"different":[79],"variables,":[80],"which":[81],"enhances":[82],"Boolean":[84],"Constraint":[85],"Propagation":[86],"(BCP).":[87],"Experimental":[88],"results":[89],"on":[90],"ISCAS'85":[91],"CEC":[92],"instances":[93],"show":[94],"that":[95],"with":[96],"clauses,":[99],"an":[100],"average":[101],"speedup":[102],"more":[104],"than":[105],"950x":[106],"was":[107],"achieved.":[108]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}