{"id":"https://openalex.org/W2101344554","doi":"https://doi.org/10.1109/hldvt.2008.4695874","title":"Multi-level Bounded Model Checking to detect bugs beyond the bound","display_name":"Multi-level Bounded Model Checking to detect bugs beyond the bound","publication_year":2008,"publication_date":"2008-11-01","ids":{"openalex":"https://openalex.org/W2101344554","doi":"https://doi.org/10.1109/hldvt.2008.4695874","mag":"2101344554"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2008.4695874","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2008.4695874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International High Level Design Validation and Test Workshop","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/A5025475799","display_name":"Tasuku Nishihara","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tasuku Nishihara","raw_affiliation_strings":["Department of Electronics Engineering, University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Electronics Engineering, University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041705350","display_name":"Takeshi Matsumoto","orcid":"https://orcid.org/0000-0002-4529-145X"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takeshi Matsumoto","raw_affiliation_strings":["VLSI Design and Education Center, University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"VLSI Design and Education Center, University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084115884","display_name":"Masahiro Fujita","orcid":"https://orcid.org/0000-0002-0642-5099"},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masahiro Fujita","raw_affiliation_strings":["VLSI Design and Education Center, University of Tokyo, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"VLSI Design and Education Center, University of Tokyo, Tokyo, Japan","institution_ids":["https://openalex.org/I74801974"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025475799"],"corresponding_institution_ids":["https://openalex.org/I74801974"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12206326,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"58","issue":null,"first_page":"49","last_page":"55"},"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.9988999962806702,"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.9973999857902527,"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/reachability","display_name":"Reachability","score":0.8918378353118896},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.8516014814376831},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8179915547370911},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7298034429550171},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.6324641704559326},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.5761964321136475},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5261618494987488},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5243399739265442},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.49072277545928955},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4817093014717102},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4551316797733307},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20792892575263977},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19588324427604675}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8918378353118896},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8516014814376831},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8179915547370911},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7298034429550171},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.6324641704559326},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.5761964321136475},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5261618494987488},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5243399739265442},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.49072277545928955},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4817093014717102},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4551316797733307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20792892575263977},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19588324427604675},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hldvt.2008.4695874","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2008.4695874","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International High Level Design Validation and Test Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.75}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1480531236","https://openalex.org/W1489391022","https://openalex.org/W1495266209","https://openalex.org/W1567363020","https://openalex.org/W1583869287","https://openalex.org/W1597578789","https://openalex.org/W1967845657","https://openalex.org/W2158395308","https://openalex.org/W2401003083","https://openalex.org/W2493328864","https://openalex.org/W6629085924","https://openalex.org/W6629648295","https://openalex.org/W6635300605","https://openalex.org/W6683354071"],"related_works":["https://openalex.org/W2365988016","https://openalex.org/W4300463216","https://openalex.org/W2884574904","https://openalex.org/W2400856453","https://openalex.org/W1785234853","https://openalex.org/W2038864046","https://openalex.org/W1993103557","https://openalex.org/W4312733571","https://openalex.org/W1483297389","https://openalex.org/W1547517160"],"abstract_inverted_index":{"Bounded":[0,149],"Model":[1,150],"Checking":[2],"is":[3,88,99,117,124,144,164,175],"a":[4,51,86,97,115],"widely":[5],"used":[6],"technique":[7],"both":[8],"in":[9,76],"hardware":[10],"and":[11,62,91],"software":[12],"verification.":[13],"However,":[14],"it":[15,32,123],"cannot":[16,33],"be":[17,27,38],"applied":[18],"if":[19,114],"the":[20,77,104,107,111,119,130,133,137,140,158,162,169,197],"bounds":[21],"(number":[22],"of":[23,59,94,110],"time":[24,186],"frames":[25,187],"to":[26,102,121,136,167,182],"analyzed)":[28],"becomes":[29,142],"large.":[30],"Therefore":[31],"detect":[34],"bugs":[35],"that":[36,176],"can":[37,68,200],"observed":[39],"only":[40],"through":[41],"very":[42],"long":[43],"sequence":[44],"counter-examples.":[45],"In":[46,82],"this":[47,212],"paper,":[48],"we":[49],"present":[50],"method":[52,67,199],"connecting":[53],"multiple":[54],"BMCs":[55],"by":[56,72,126,147],"sophisticated":[57],"uses":[58],"inductive":[60],"approach":[61],"symbolic":[63,127],"simulation.":[64,128],"The":[65],"proposed":[66,198],"check":[69],"unbounded":[70],"properties":[71],"analyzing":[73],"loop":[74],"behaviors":[75],"design":[78],"with":[79,190,207],"decision":[80],"procedures.":[81],"our":[83],"verification":[84],"flow,":[85],"property":[87,98,163],"automatically":[89],"decomposed":[90,100],"refined":[92,165],"instead":[93],"designs.":[95],"First,":[96],"not":[101,155,166,180],"consider":[103],"reachability":[105,131],"from":[106,132,157,193],"initial":[108,134,159,194],"states":[109,135,138],"design.":[112],"Next,":[113],"counter-example":[116],"found,":[118],"condition":[120,141],"enter":[122,168],"generated":[125],"Finally,":[129],"where":[139],"true":[143],"checked":[145],"inductively":[146],"another":[148],"Checking.":[151],"If":[152],"they":[153],"are":[154],"reachable":[156],"states,":[160],"then":[161],"unreal":[170],"counter-example.":[171],"Key":[172],"observation":[173],"here":[174],"each":[177],"BMC":[178,192],"does":[179],"need":[181],"process":[183,201],"so":[184],"many":[185],"as":[188],"compared":[189],"pure":[191],"states.":[195],"Therefore,":[196],"much":[202],"larger":[203],"bounds.":[204],"Experimental":[205],"results":[206],"two":[208],"examples":[209],"have":[210],"confirmed":[211],"advantage.":[213]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}