{"id":"https://openalex.org/W4241193439","doi":"https://doi.org/10.1109/iccad.2010.5653863","title":"Efficient state space exploration: Interleaving stateless and state-based model checking","display_name":"Efficient state space exploration: Interleaving stateless and state-based model checking","publication_year":2010,"publication_date":"2010-11-01","ids":{"openalex":"https://openalex.org/W4241193439","doi":"https://doi.org/10.1109/iccad.2010.5653863"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2010.5653863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2010.5653863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","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/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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100406890","display_name":"Chao Wang","orcid":"https://orcid.org/0000-0001-7398-1127"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chao Wang","raw_affiliation_strings":["NEC Laboratories, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100781284","display_name":"Weihong Li","orcid":"https://orcid.org/0000-0002-6462-1848"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Weihong Li","raw_affiliation_strings":["NEC Laboratories, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NEC Laboratories, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6871,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75174709,"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":"786","last_page":"793"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9980000257492065,"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/model-checking","display_name":"Model checking","score":0.8265010118484497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8147179484367371},{"id":"https://openalex.org/keywords/stateless-protocol","display_name":"Stateless protocol","score":0.7791538238525391},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5506824254989624},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.5480395555496216},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5450314879417419},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5348255634307861},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.5145511031150818},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.47361183166503906},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43759840726852417},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43689513206481934},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4008267819881439},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3925842344760895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30774855613708496},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.27330082654953003},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.10931128263473511}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.8265010118484497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8147179484367371},{"id":"https://openalex.org/C103613024","wikidata":"https://www.wikidata.org/wiki/Q230924","display_name":"Stateless protocol","level":3,"score":0.7791538238525391},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5506824254989624},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.5480395555496216},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5450314879417419},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5348255634307861},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.5145511031150818},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.47361183166503906},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43759840726852417},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43689513206481934},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4008267819881439},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3925842344760895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30774855613708496},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27330082654953003},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.10931128263473511},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2010.5653863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2010.5653863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W621300437","https://openalex.org/W1495266209","https://openalex.org/W1498403163","https://openalex.org/W1516135678","https://openalex.org/W1521022632","https://openalex.org/W1533964197","https://openalex.org/W1551256212","https://openalex.org/W1578141429","https://openalex.org/W1975112016","https://openalex.org/W1983064190","https://openalex.org/W2030429229","https://openalex.org/W2054424606","https://openalex.org/W2067593607","https://openalex.org/W2084330491","https://openalex.org/W2097699872","https://openalex.org/W2104993088","https://openalex.org/W2109040066","https://openalex.org/W2114555045","https://openalex.org/W2115309705","https://openalex.org/W2125967324","https://openalex.org/W2129538349","https://openalex.org/W2129614355","https://openalex.org/W2131863441","https://openalex.org/W2133862387","https://openalex.org/W2170701417","https://openalex.org/W3149523047","https://openalex.org/W4231563560","https://openalex.org/W4231640108","https://openalex.org/W4237279679","https://openalex.org/W4237492309","https://openalex.org/W4300021588","https://openalex.org/W6629648295","https://openalex.org/W6629706558","https://openalex.org/W6631959887","https://openalex.org/W6632973628","https://openalex.org/W6638020115","https://openalex.org/W6646012149","https://openalex.org/W6667539801","https://openalex.org/W6678730870","https://openalex.org/W6679495168"],"related_works":["https://openalex.org/W3040374273","https://openalex.org/W4250225510","https://openalex.org/W1979520342","https://openalex.org/W3172202899","https://openalex.org/W3141316173","https://openalex.org/W2172190585","https://openalex.org/W1015146240","https://openalex.org/W2502580831","https://openalex.org/W4241193439","https://openalex.org/W2058344951"],"abstract_inverted_index":{"State-based":[0],"model":[1,12,64,92],"checking":[2,13,65,93],"methods":[3,14,33,39,55],"comprise":[4],"computing":[5,25],"and":[6,26,71,87,105,116],"storing":[7,27,119],"reachable":[8,18,29,122],"states,":[9],"while":[10,37],"stateless":[11,38],"directly":[15],"reason":[16],"about":[17],"paths":[19],"using":[20],"decision":[21],"procedures,":[22],"thereby":[23],"avoiding":[24],"the":[28,50,76,113,120,144,147],"states.":[30],"Typically,":[31],"state-based":[32],"involve":[34,40],"memory-intensive":[35],"operations,":[36],"time-intensive":[41],"operations.":[42],"We":[43,125,142],"propose":[44],"a":[45,79,132],"divide-and-conquer":[46],"strategy":[47],"to":[48,74,110,117],"combine":[49],"complementary":[51],"strengths":[52],"of":[53,59,78,146],"these":[54],"for":[56],"efficient":[57],"verification":[58,135],"embedded":[60],"software.":[61],"Specifically,":[62],"our":[63,128],"engine":[66],"uses":[67],"both":[68],"state":[69,72,114,123],"decomposition":[70],"prioritization":[73],"guide":[75],"combination":[77],"Presburger":[80],"arithmetic":[81],"based":[82,90],"symbolic":[83],"traversal":[84],"algorithm":[85,94],"(state-based)":[86],"an":[88],"SMT":[89],"bounded":[91],"(stateless).":[95],"These":[96],"two":[97],"underlying":[98],"algorithms":[99],"are":[100],"interleaved-based":[101],"on":[102,150],"memory/time":[103],"bounds":[104],"dynamic":[106],"task":[107],"partitioning-in":[108],"order":[109],"systematically":[111],"explore":[112],"space":[115],"avoid":[118],"entire":[121],"set.":[124],"have":[126],"implemented":[127],"new":[129],"method":[130,149],"in":[131],"tightly":[133],"integrated":[134],"tool":[136],"called":[137],"HMC":[138],"(Hybrid":[139],"Model":[140],"Checker).":[141],"demonstrate":[143],"efficacy":[145],"proposed":[148],"some":[151],"industry":[152],"examples.":[153]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}