{"id":"https://openalex.org/W2028329758","doi":"https://doi.org/10.1145/1119772.1119790","title":"SAT-based sequential depth computation","display_name":"SAT-based sequential depth computation","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2028329758","doi":"https://doi.org/10.1145/1119772.1119790","mag":"2028329758"},"language":"en","primary_location":{"id":"doi:10.1145/1119772.1119790","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119772.1119790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 conference on Asia South Pacific design automation  - ASPDAC","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/A5003499304","display_name":"Maher Mneimneh","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Maher Mneimneh","raw_affiliation_strings":["University of Michigan","Michigan Univ., MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Michigan Univ., MI, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077314055","display_name":"Karem A. Sakallah","orcid":"https://orcid.org/0000-0002-5819-9089"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karem Sakallah","raw_affiliation_strings":["University of Michigan","Michigan Univ., MI, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Michigan Univ., MI, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003499304"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":5.1321,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.95697361,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"87","last_page":"87"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9950000047683716,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9847000241279602,"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/netlist","display_name":"Netlist","score":0.8981961011886597},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.7301200032234192},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6774429678916931},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6644142270088196},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6067719459533691},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.58757084608078},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.5742515921592712},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5498644113540649},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5431340336799622},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5241496562957764},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5144691467285156},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5002620220184326},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4999370574951172},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4990367889404297},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.496207058429718},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48908501863479614},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47986143827438354},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.4789162874221802},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24710014462471008},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19772496819496155},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1377895474433899}],"concepts":[{"id":"https://openalex.org/C177650935","wikidata":"https://www.wikidata.org/wiki/Q1760303","display_name":"Netlist","level":2,"score":0.8981961011886597},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7301200032234192},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6774429678916931},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6644142270088196},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6067719459533691},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.58757084608078},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.5742515921592712},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5498644113540649},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5431340336799622},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5241496562957764},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5144691467285156},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5002620220184326},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4999370574951172},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4990367889404297},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.496207058429718},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48908501863479614},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47986143827438354},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.4789162874221802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24710014462471008},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19772496819496155},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1377895474433899},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1119772.1119790","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119772.1119790","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 conference on Asia South Pacific design automation  - ASPDAC","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":10,"referenced_works":["https://openalex.org/W99525586","https://openalex.org/W1495266209","https://openalex.org/W1787074469","https://openalex.org/W1979840340","https://openalex.org/W2024148935","https://openalex.org/W2080267935","https://openalex.org/W2099120582","https://openalex.org/W2117189826","https://openalex.org/W2142785340","https://openalex.org/W2156490005"],"related_works":["https://openalex.org/W139930128","https://openalex.org/W2078076811","https://openalex.org/W35365073","https://openalex.org/W2114722319","https://openalex.org/W2148332793","https://openalex.org/W4242390528","https://openalex.org/W2348129335","https://openalex.org/W4241989857","https://openalex.org/W2109676928","https://openalex.org/W1998291836"],"abstract_inverted_index":{"Determining":[0],"the":[1,11,45,48,56,62,65,87],"depth":[2,27],"of":[3,13,47,64,86],"sequential":[4,26],"circuits":[5],"is":[6],"a":[7,30,40],"crucial":[8],"step":[9],"towards":[10],"completeness":[12],"bounded":[14],"model":[15],"checking":[16],"proofs":[17],"in":[18],"hardware":[19],"verification.":[20],"In":[21],"this":[22],"paper,":[23],"we":[24],"formulate":[25],"computation":[28],"as":[29],"logical":[31],"inference":[32],"problem":[33],"for":[34],"Quantified":[35],"Boolean":[36],"Formulas.":[37],"We":[38,59,79],"introduce":[39],"novel":[41],"technique":[42],"to":[43,55,75],"simplify":[44],"complexity":[46],"constructed":[49],"formulas":[50],"by":[51],"applying":[52],"simple":[53],"transformations":[54],"circuit":[57],"netlist.":[58],"also":[60],"study":[61],"structure":[63],"resulting":[66],"simplified":[67],"QBFs":[68],"and":[69],"construct":[70],"an":[71],"efficient":[72],"SAT-based":[73],"algorithm":[74],"check":[76],"their":[77],"satisfiability.":[78],"report":[80],"promising":[81],"experimental":[82],"results":[83],"on":[84],"some":[85],"ISCAS":[88],"89":[89],"benchmarks.":[90]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2025-10-10T00:00:00"}