{"id":"https://openalex.org/W1997279482","doi":"https://doi.org/10.1145/2483028.2483128","title":"Set-cover-based critical implications selection to improvesat-based bounded model checking","display_name":"Set-cover-based critical implications selection to improvesat-based bounded model checking","publication_year":2013,"publication_date":"2013-05-02","ids":{"openalex":"https://openalex.org/W1997279482","doi":"https://doi.org/10.1145/2483028.2483128","mag":"1997279482"},"language":"en","primary_location":{"id":"doi:10.1145/2483028.2483128","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2483028.2483128","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd ACM international conference on 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/A5028059886","display_name":"Mahmoud Elbayoumi","orcid":"https://orcid.org/0000-0002-9380-3763"},"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":true,"raw_author_name":"Mahmoud Elbayoumi","raw_affiliation_strings":["Virginia Tech, Blacksburg, VA, USA","Virginia Tech, , Blacksburg, VA, USA"],"affiliations":[{"raw_affiliation_string":"Virginia Tech, 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":"middle","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":"Michael S. Hsiao","raw_affiliation_strings":["Virginia Tech, Blacksburg, VA, USA","Virginia Tech, , Blacksburg, VA, USA"],"affiliations":[{"raw_affiliation_string":"Virginia Tech, 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/A5003978616","display_name":"Mustafa ElNainay","orcid":"https://orcid.org/0000-0002-2215-8736"},"institutions":[{"id":"https://openalex.org/I84524832","display_name":"Alexandria University","ror":"https://ror.org/00mzz1w90","country_code":"EG","type":"education","lineage":["https://openalex.org/I84524832"]}],"countries":["EG"],"is_corresponding":false,"raw_author_name":"Mustafa ElNainay","raw_affiliation_strings":["Alexandria Univ, Alexandria , Egypt","Alexandria University, Alexandria, Egypt"],"affiliations":[{"raw_affiliation_string":"Alexandria Univ, Alexandria , Egypt","institution_ids":["https://openalex.org/I84524832"]},{"raw_affiliation_string":"Alexandria University, Alexandria, Egypt","institution_ids":["https://openalex.org/I84524832"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5028059886"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":1.0876,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.77598626,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"331","last_page":"332"},"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.9929999709129333,"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/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9842000007629395,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7530451416969299},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7388349175453186},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7031160593032837},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6544904708862305},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6235752105712891},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6053874492645264},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6049888730049133},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5833651423454285},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.579093337059021},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5629176497459412},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5343465209007263},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5124068856239319},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45849621295928955},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4224478602409363},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31533539295196533},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3145608901977539},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19016265869140625},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11890962719917297}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7530451416969299},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7388349175453186},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7031160593032837},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6544904708862305},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6235752105712891},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6053874492645264},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6049888730049133},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5833651423454285},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.579093337059021},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5629176497459412},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5343465209007263},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5124068856239319},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45849621295928955},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4224478602409363},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31533539295196533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3145608901977539},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19016265869140625},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11890962719917297},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2483028.2483128","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2483028.2483128","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1560470017","https://openalex.org/W2024148935","https://openalex.org/W2040924621","https://openalex.org/W2145117664"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2202486749","https://openalex.org/W1550117727","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W4281812495","https://openalex.org/W2325870907","https://openalex.org/W1913543287"],"abstract_inverted_index":{"The":[0],"effectiveness":[1],"of":[2,15,43,76,85],"Satisfiability":[3],"(SAT)-based":[4],"Bounded":[5],"Model":[6],"Checking":[7],"(BMC)":[8],"critically":[9],"relies":[10],"on":[11],"the":[12,16,48,83,92,96,109,118,123],"deductive":[13],"power":[14],"BMC":[17,105,119,125],"instance.":[18,120],"Although":[19],"implication":[20],"relationships":[21],"have":[22,57,67],"been":[23],"used":[24],"to":[25,29,117,130],"help":[26],"SAT":[27,50,93],"solver":[28,51,94],"make":[30],"more":[31],"deductions,":[32],"too":[33],"many":[34],"such":[35],"implications":[36,114],"would":[37],"result":[38],"in":[39],"a":[40,62,69],"large":[41],"number":[42,84],"clauses":[44],"and":[45],"potentially":[46],"degrade":[47],"underlying":[49],"performance.":[52],"In":[53],"this":[54],"paper,":[55],"we":[56,66],"formulated":[58],"clause":[59],"selection":[60,75],"as":[61],"set-cover":[63],"problem.":[64],"Secondly,":[65],"proposed":[68],"novel":[70],"greedy":[71],"strategy":[72,103],"for":[73],"optimal":[74],"static":[77],"logic":[78],"clauses.":[79],"This":[80],"technique":[81],"maximizes":[82],"literals":[86],"that":[87],"can":[88,133],"be":[89,134],"deduced":[90],"by":[91,106],"during":[95],"Boolean":[97],"Constraint":[98],"Propagation":[99],"(BCP)":[100],"operation.":[101],"Our":[102],"improves":[104],"1.74x":[107],"against":[108],"case":[110],"where":[111],"all":[112],"extended":[113],"were":[115],"added":[116],"Compared":[121],"with":[122],"original":[124],"without":[126],"any":[127],"implications,":[128],"up":[129],"55.32x":[131],"speedup":[132],"achieved.":[135]},"counts_by_year":[{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}