{"id":"https://openalex.org/W3151450057","doi":"https://doi.org/10.1109/date.2008.4484777","title":"Completeness in SMT-based BMC for Software Programs","display_name":"Completeness in SMT-based BMC for Software Programs","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W3151450057","doi":"https://doi.org/10.1109/date.2008.4484777","mag":"3151450057"},"language":"en","primary_location":{"id":"doi:10.1109/date.2008.4484777","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2008.4484777","pdf_url":null,"source":{"id":"https://openalex.org/S4363607582","display_name":"2008 Design, Automation and Test in Europe","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 Design, Automation and Test in Europe","raw_type":"proceedings-article"},"type":"conference-paper","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Malay K. Ganai","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041231710","display_name":"Aarti Gupta","orcid":"https://orcid.org/0000-0001-6676-9400"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aarti Gupta","raw_affiliation_strings":["NEC Laboratories of America, Inc., Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories of America, Inc., Princeton, NJ, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1428,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77501305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"831","last_page":"836"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"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.9979000091552734,"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.9976999759674072,"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.9824000000953674,"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/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.701035737991333},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6519075632095337},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5527087450027466},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5303022861480713},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5272974967956543},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.5227013826370239},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5216223001480103},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.49177196621894836},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4394630789756775},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41072142124176025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4079934060573578},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40283918380737305},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.377133309841156},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.32991543412208557}],"concepts":[{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.701035737991333},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6519075632095337},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5527087450027466},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5303022861480713},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5272974967956543},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.5227013826370239},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5216223001480103},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.49177196621894836},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4394630789756775},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41072142124176025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4079934060573578},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40283918380737305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.377133309841156},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32991543412208557},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/date.2008.4484777","is_oa":false,"landing_page_url":"https://doi.org/10.1109/date.2008.4484777","pdf_url":null,"source":{"id":"https://openalex.org/S4363607582","display_name":"2008 Design, Automation and Test in Europe","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 Design, Automation and Test in Europe","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W621300437","https://openalex.org/W1495266209","https://openalex.org/W1533964197","https://openalex.org/W1549820563","https://openalex.org/W1598168882","https://openalex.org/W1787074469","https://openalex.org/W2084330491","https://openalex.org/W2125967324","https://openalex.org/W2129538349","https://openalex.org/W2163482209","https://openalex.org/W4300021588","https://openalex.org/W6629648295","https://openalex.org/W6631942974","https://openalex.org/W6632923231","https://openalex.org/W6635615308","https://openalex.org/W6638020115","https://openalex.org/W6677189924","https://openalex.org/W6677699145","https://openalex.org/W6678730870","https://openalex.org/W6679495168"],"related_works":["https://openalex.org/W2117548279","https://openalex.org/W2400856453","https://openalex.org/W1993103557","https://openalex.org/W2810367355","https://openalex.org/W2293855260","https://openalex.org/W2155162307","https://openalex.org/W4295885746","https://openalex.org/W2131919998","https://openalex.org/W1594074817","https://openalex.org/W1982981798"],"abstract_inverted_index":{"Bounded":[0],"Model":[1],"Checking":[2],"(BMC)":[3],"is":[4],"incomplete":[5],"without":[6],"a":[7,24,47,64,112],"completeness":[8],"threshold":[9],"(CT)":[10],"bound.":[11],"Previous":[12],"methods,":[13],"using":[14,81],"recurrence":[15],"diameter":[16],"for":[17,21,41,78],"obtaining":[18,42],"CT,":[19],"check":[20],"existence":[22],"of":[23,49,66,103],"longest":[25],"loop-free":[26],"path":[27],"at":[28,52,71],"every":[29,72],"depth":[30],"k.":[31],"For":[32],"terminating":[33],"software":[34,124],"programs,":[35],"we":[36],"propose":[37],"an":[38],"efficient":[39],"method":[40],"CT":[43,104],"that":[44,61,127],"requires":[45],"solving":[46,63],"formula":[48,65],"size":[50,70],"O(k)":[51],"some":[53],"depths":[54],"only,":[55],"as":[56],"compared":[57],"to":[58],"previous":[59,76,135],"methods":[60,77],"require":[62],"O(k2)":[67],"(or":[68],"O(klogk))":[69],"depth.":[73],"We":[74,106],"augment":[75],"BMC":[79,95,117],"simplifications":[80,96],"model":[82],"transformation":[83],"and":[84,97],"control":[85],"flow":[86],"information,":[87],"with":[88],"context-sensitive":[89],"analysis.":[90],"This":[91],"results":[92],"in":[93,100,111],"more":[94],"further":[98],"reduction":[99],"the":[101],"number":[102],"checks.":[105],"have":[107],"implemented":[108],"our":[109,128],"techniques":[110],"Satisfiability":[113],"Modulo":[114],"Theory":[115],"(SMT)-based":[116],"framework.":[118],"Our":[119],"controlled":[120],"experiments":[121],"on":[122],"real-world":[123],"programs":[125],"show":[126],"proposed":[129],"formulation":[130],"provides":[131],"significant":[132],"improvements":[133],"over":[134],"approaches.":[136]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}