{"id":"https://openalex.org/W1516564968","doi":"https://doi.org/10.1109/iccad.2004.1382631","title":"Efficient SAT-based unbounded symbolic model checking using circuit cofactoring","display_name":"Efficient SAT-based unbounded symbolic model checking using circuit cofactoring","publication_year":2005,"publication_date":"2005-02-22","ids":{"openalex":"https://openalex.org/W1516564968","doi":"https://doi.org/10.1109/iccad.2004.1382631","mag":"1516564968"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2004.1382631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382631","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","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/A5085310714","display_name":"Malay Ganai","orcid":"https://orcid.org/0000-0003-0593-3419"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.K. Ganai","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA","NEC-Labs America, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"NEC-Labs America, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041231710","display_name":"Aarti Gupta","orcid":"https://orcid.org/0000-0001-6676-9400"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Gupta","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA","NEC-Labs America, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"NEC-Labs America, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060336834","display_name":"Pranav Ashar","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Ashar","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA","NEC-Labs America, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"NEC-Labs America, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.1559,"has_fulltext":false,"cited_by_count":86,"citation_normalized_percentile":{"value":0.99322376,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"510","last_page":"517"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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.9993000030517578,"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.9972000122070312,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9926000237464905,"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/heuristics","display_name":"Heuristics","score":0.7265281081199646},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6983816623687744},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.6628751158714294},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6420522928237915},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6359990239143372},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6184325218200684},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5157523155212402},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47172871232032776},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4686547815799713},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4304552674293518},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21544292569160461},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1529744267463684},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13830327987670898}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7265281081199646},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6983816623687744},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.6628751158714294},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6420522928237915},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6359990239143372},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6184325218200684},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5157523155212402},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47172871232032776},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4686547815799713},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4304552674293518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21544292569160461},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1529744267463684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13830327987670898},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2004.1382631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2004.1382631","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1494481937","https://openalex.org/W1495266209","https://openalex.org/W1498403163","https://openalex.org/W1503170978","https://openalex.org/W1506660274","https://openalex.org/W1510368738","https://openalex.org/W1511155470","https://openalex.org/W1517173520","https://openalex.org/W1549820563","https://openalex.org/W1787074469","https://openalex.org/W1814068099","https://openalex.org/W2024148935","https://openalex.org/W2044560939","https://openalex.org/W2057361103","https://openalex.org/W2110728526","https://openalex.org/W2110737535","https://openalex.org/W2111265695","https://openalex.org/W2142785340","https://openalex.org/W2144883917","https://openalex.org/W2146422945","https://openalex.org/W2146662253","https://openalex.org/W2151398141","https://openalex.org/W2152280960","https://openalex.org/W2153831980","https://openalex.org/W2156358952","https://openalex.org/W2173124859","https://openalex.org/W2913459036","https://openalex.org/W4235938950","https://openalex.org/W4238843037","https://openalex.org/W4241233758","https://openalex.org/W4245068431","https://openalex.org/W4252315883","https://openalex.org/W4300021588","https://openalex.org/W6629484655","https://openalex.org/W6630480306","https://openalex.org/W6630511988","https://openalex.org/W6630643794","https://openalex.org/W6638020115"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W2406961474","https://openalex.org/W4300125793","https://openalex.org/W2578985712","https://openalex.org/W2952598754","https://openalex.org/W3042106073","https://openalex.org/W4390481443","https://openalex.org/W3097218026","https://openalex.org/W4391528888","https://openalex.org/W1490609548"],"abstract_inverted_index":{"We":[0,84,107,147,164],"describe":[1],"an":[2,196],"efficient":[3],"approach":[4,52,159],"for":[5],"SAT-based":[6,20,37,114,123],"quantifier":[7,41],"elimination":[8],"that":[9,137,199],"significantly":[10],"improves":[11],"the":[12,55,69,81,94,102,120,171,178,189],"performance":[13],"of":[14,33,50,57,65,71,89,104,122,133,151,173,191],"pre-image":[15],"and":[16,67,129,155],"fixed-point":[17],"computation":[18],"in":[19,43,54,68,112,153,177,195],"unbounded":[21],"symbolic":[22],"model":[23,141],"checking":[24],"(UMC).":[25],"The":[26,48],"proposed":[27,176],"method":[28,188],"captures":[29],"a":[30,62,72,87,113,131,192],"larger":[31],"set":[32,64,96],"new":[34],"states":[35],"per":[36,98],"enumeration":[38,105],"step":[39],"during":[40],"elimination,":[42],"comparison":[44],"to":[45,60,79,91,140,169,184],"previous":[46,161],"approaches.":[47,163,207],"novelty":[49],"our":[51,110,158,187],"is":[53],"use":[56,70],"circuit-based":[58],"cofactoring":[59],"capture":[61],"large":[63,134],"states,":[66],"functional":[73],"hashing":[74],"based":[75],"simplified":[76],"circuit":[77],"graph":[78],"represent":[80],"captured":[82],"states.":[83],"also":[85,165],"propose":[86],"number":[88,103,132],"heuristics":[90,175],"further":[92],"enlarge":[93],"state":[95],"represented":[97],"enumeration,":[99],"thereby":[100],"reducing":[101],"steps.":[106],"have":[108],"implemented":[109],"techniques":[111],"UMC":[115],"framework":[116],"where":[117],"we":[118,181],"show":[119,148],"effectiveness":[121],"existential":[124],"quantification":[125],"on":[126,130],"public":[127],"benchmarks,":[128],"industry":[135,197],"designs":[136],"were":[138,182],"hard":[139],"check":[142],"using":[143,157,186,204],"purely":[144],"BDD-based":[145],"techniques.":[146],"several":[149,174],"orders":[150],"improvement":[152],"time":[154],"space":[156],"over":[160],"CNF-based":[162],"present":[166],"controlled":[167],"experiments":[168],"demonstrate":[170],"role":[172],"paper.":[179],"Importantly,":[180],"able":[183],"prove":[185],"correctness":[190],"safety":[193],"property":[194],"design":[198],"could":[200],"not":[201],"be":[202],"proved":[203],"other":[205],"known":[206]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}