{"id":"https://openalex.org/W2126983591","doi":"https://doi.org/10.1145/1057661.1057725","title":"Utilizing don't care states in SAT-based bounded sequential problems","display_name":"Utilizing don't care states in SAT-based bounded sequential problems","publication_year":2005,"publication_date":"2005-04-17","ids":{"openalex":"https://openalex.org/W2126983591","doi":"https://doi.org/10.1145/1057661.1057725","mag":"2126983591"},"language":"en","primary_location":{"id":"doi:10.1145/1057661.1057725","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1057661.1057725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM Great Lakes symposium on VLSI","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/A5111477668","display_name":"Sean Safarpour","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Sean Safarpour","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008766097","display_name":"G\u00f6rschwin Fey","orcid":"https://orcid.org/0000-0001-6433-6265"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"G\u00f6rschwin Fey","raw_affiliation_strings":["Bremen University, Bremen, Germany","Bremen University, Bremen , Germany"],"affiliations":[{"raw_affiliation_string":"Bremen University, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]},{"raw_affiliation_string":"Bremen University, Bremen , Germany","institution_ids":["https://openalex.org/I180437899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009841786","display_name":"Andreas Veneris","orcid":"https://orcid.org/0000-0002-6309-8821"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Andreas Veneris","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071742136","display_name":"Rolf Drechsler","orcid":"https://orcid.org/0000-0002-9872-1740"},"institutions":[{"id":"https://openalex.org/I180437899","display_name":"University of Bremen","ror":"https://ror.org/04ers2y35","country_code":"DE","type":"education","lineage":["https://openalex.org/I180437899"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf Drechsler","raw_affiliation_strings":["Bremen University, Bremen, Germany","Bremen University, Bremen , Germany"],"affiliations":[{"raw_affiliation_string":"Bremen University, Bremen, Germany","institution_ids":["https://openalex.org/I180437899"]},{"raw_affiliation_string":"Bremen University, Bremen , Germany","institution_ids":["https://openalex.org/I180437899"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111477668"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":1.0099,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78522749,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"264","last_page":"269"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9994000196456909,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8535990715026855},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7734702825546265},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6390202641487122},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5847524404525757},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5162037014961243},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.49235665798187256},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43687283992767334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3454321026802063},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34160053730010986},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32639598846435547},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3087393045425415},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10304799675941467}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8535990715026855},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7734702825546265},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6390202641487122},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5847524404525757},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5162037014961243},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.49235665798187256},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43687283992767334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3454321026802063},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34160053730010986},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32639598846435547},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3087393045425415},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10304799675941467},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1057661.1057725","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1057661.1057725","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM Great Lakes symposium on VLSI","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.69.136","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.136","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecg.utoronto.ca/~veneris/5gls2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.88.4142","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.4142","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-bremen.de/agra/doc/konf/05GLSVLSI_manageDC.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1498403163","https://openalex.org/W1505590927","https://openalex.org/W1579329129","https://openalex.org/W1583869287","https://openalex.org/W2044560939","https://openalex.org/W2057318675","https://openalex.org/W2057361103","https://openalex.org/W2059510773","https://openalex.org/W2109577721","https://openalex.org/W2129369779","https://openalex.org/W2133143481","https://openalex.org/W2137889577","https://openalex.org/W2142785340","https://openalex.org/W2149968564","https://openalex.org/W2160444875","https://openalex.org/W2160667400","https://openalex.org/W2167452021","https://openalex.org/W2623224373"],"related_works":["https://openalex.org/W2186864281","https://openalex.org/W4255427455","https://openalex.org/W1966025497","https://openalex.org/W68941528","https://openalex.org/W4206451355","https://openalex.org/W2400856453","https://openalex.org/W1993103557","https://openalex.org/W2115480761","https://openalex.org/W4386614288","https://openalex.org/W2920896101"],"abstract_inverted_index":{"Boolean":[0],"Satisfiability":[1],"(SAT)":[2],"solvers":[3],"are":[4],"popular":[5],"engines":[6],"used":[7],"throughout":[8],"the":[9,41,44,71,76,81,86,89],"verification":[10],"world.":[11],"Bounded":[12],"sequential":[13,22,50],"problems":[14,51],"such":[15],"as":[16],"bounded":[17,21,49],"model":[18],"checking":[19,24],"and":[20,28,69],"equivalence":[23],"rely":[25],"on":[26,92],"fast":[27],"robust":[29],"SAT":[30,46],"solvers.":[31],"In":[32],"this":[33],"work,":[34],"we":[35],"introduce":[36],"a":[37,56],"technique":[38],"that":[39],"improves":[40],"performance":[42],"of":[43,55,66,88],"underlying":[45],"solver":[47],"for":[48],"by":[52],"taking":[53],"advantage":[54],"design's":[57],"don't":[58,72],"care":[59,73],"states.":[60],"We":[61],"develop":[62],"cost":[63],"effective":[64],"methods":[65],"filtering,":[67],"replicating":[68],"applying":[70],"states":[74],"to":[75],"original":[77],"problem":[78],"thus":[79],"reducing":[80],"search":[82],"space.":[83],"Experiments":[84],"demonstrate":[85],"effectiveness":[87],"proposed":[90],"method":[91],"ISCAS'89":[93],"benchmarks.":[94]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}