{"id":"https://openalex.org/W2065894483","doi":"https://doi.org/10.1109/iccd.2013.6657070","title":"Selecting critical implications with set-covering formulation for SAT-based Bounded Model Checking","display_name":"Selecting critical implications with set-covering formulation for SAT-based Bounded Model Checking","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2065894483","doi":"https://doi.org/10.1109/iccd.2013.6657070","mag":"2065894483"},"language":"en","primary_location":{"id":"doi:10.1109/iccd.2013.6657070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccd.2013.6657070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 31st International Conference on Computer Design (ICCD)","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":["ECE Dept., Virginia Tech, Blacksburg, VA","ECE Department, Virginia Tech, Blacksburg, VA, USA"],"affiliations":[{"raw_affiliation_string":"ECE Dept., Virginia Tech, Blacksburg, VA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"ECE Department, 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":["ECE Dept., Virginia Tech, Blacksburg, VA","ECE Department, Virginia Tech, Blacksburg, VA, USA"],"affiliations":[{"raw_affiliation_string":"ECE Dept., Virginia Tech, Blacksburg, VA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"ECE Department, 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":["CSE Dept., Alexandria University Alexandria, Egypt","CSE Dept., Alexandria Univ., Alexandria, Egypt"],"affiliations":[{"raw_affiliation_string":"CSE Dept., Alexandria University Alexandria, Egypt","institution_ids":["https://openalex.org/I84524832"]},{"raw_affiliation_string":"CSE Dept., Alexandria Univ., 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":4,"citation_normalized_percentile":{"value":0.78890504,"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":"390","last_page":"395"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.9984999895095825,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9958999752998352,"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/speedup","display_name":"Speedup","score":0.7667545080184937},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7336156964302063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6968356370925903},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6943336129188538},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6562764644622803},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5937429070472717},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5831182599067688},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5797968506813049},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43564945459365845},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.42766398191452026},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3255111575126648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32343459129333496},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2576344907283783},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.25271278619766235},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1655597686767578},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11464241147041321}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7667545080184937},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7336156964302063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6968356370925903},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6943336129188538},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6562764644622803},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5937429070472717},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5831182599067688},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5797968506813049},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43564945459365845},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.42766398191452026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3255111575126648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32343459129333496},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2576344907283783},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.25271278619766235},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1655597686767578},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11464241147041321},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccd.2013.6657070","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccd.2013.6657070","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 31st International Conference on Computer Design (ICCD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W116833159","https://openalex.org/W1495266209","https://openalex.org/W1560470017","https://openalex.org/W1566041312","https://openalex.org/W1819209966","https://openalex.org/W1997279482","https://openalex.org/W2024148935","https://openalex.org/W2037395516","https://openalex.org/W2040924621","https://openalex.org/W2059453880","https://openalex.org/W2086337948","https://openalex.org/W2100404896","https://openalex.org/W2107470986","https://openalex.org/W2145117664","https://openalex.org/W2151398141","https://openalex.org/W2151773147","https://openalex.org/W2152641842","https://openalex.org/W2154665658","https://openalex.org/W2155305548","https://openalex.org/W2160130484","https://openalex.org/W4246219036","https://openalex.org/W4255371118","https://openalex.org/W6629648295","https://openalex.org/W6659922959","https://openalex.org/W6681433938","https://openalex.org/W6682383673"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W4386614288","https://openalex.org/W2783796426","https://openalex.org/W2806052477","https://openalex.org/W2017695771","https://openalex.org/W4243835908","https://openalex.org/W1565254111","https://openalex.org/W78771200"],"abstract_inverted_index":{"The":[0],"effectiveness":[1],"of":[2,14,36,51,90,100],"SAT-based":[3],"Bounded":[4],"Model":[5],"Checking":[6],"(BMC)":[7],"critically":[8],"relies":[9],"on":[10,96,126],"the":[11,15,57,98,107,111,146,155,160],"deductive":[12],"power":[13],"BMC":[16,141,156,162],"instance.":[17,157],"Although":[18],"implication":[19,77,165],"relationships":[20],"have":[21],"been":[22,39],"used":[23],"to":[24,28,75,154,168],"help":[25],"SAT":[26,59,108],"solver":[27,60,109],"make":[29],"more":[30],"deductions,":[31],"frequently":[32],"an":[33],"excessive":[34],"number":[35,50,99],"implications":[37,44,151],"has":[38],"used.":[40],"Too":[41],"many":[42],"such":[43],"can":[45,103,121,171],"result":[46],"in":[47],"a":[48,68,71,83,123,127],"large":[49],"clauses":[52],"that":[53,102],"could":[54],"potentially":[55],"degrade":[56],"underlying":[58],"performance.":[61],"In":[62,130],"this":[63],"paper,":[64],"we":[65,81],"first":[66],"propose":[67,82],"framework":[69],"for":[70,87],"parallel":[72,118],"deduction":[73,119],"engine":[74,120],"reduce":[76],"learning":[78],"time.":[79],"Secondly,":[80],"novel":[84],"set-cover":[85],"technique":[86,94],"optimal":[88],"selection":[89],"constraint":[91],"clauses.":[92],"This":[93],"depends":[95],"maximizing":[97],"literals":[101],"be":[104,172],"deduced":[105],"by":[106,132,142],"during":[110],"BCP":[112],"(Boolean":[113],"Constraint":[114],"Propagation)":[115],"operation.":[116],"Our":[117],"achieve":[122],"5.7\u00d7":[124],"speedup":[125,170],"36-core":[128],"machine.":[129],"addition,":[131],"selecting":[133],"only":[134],"those":[135],"critical":[136],"implications,":[137],"our":[138],"strategy":[139],"improves":[140],"another":[143],"1.74\u00d7":[144],"against":[145],"case":[147],"where":[148],"all":[149],"extended":[150],"were":[152],"added":[153],"Compared":[158],"with":[159],"original":[161],"without":[163],"any":[164],"clauses,":[166],"up":[167],"55.32\u00d7":[169],"achieved.":[173]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}