{"id":"https://openalex.org/W2055587005","doi":"https://doi.org/10.1109/hldvt.2010.5496663","title":"An improvement in decomposed reachability analysis for symbolic model checking","display_name":"An improvement in decomposed reachability analysis for symbolic model checking","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2055587005","doi":"https://doi.org/10.1109/hldvt.2010.5496663","mag":"2055587005"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2010.5496663","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2010.5496663","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","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/A5074924343","display_name":"Nicholas Donataccio","orcid":null},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nicholas Donataccio","raw_affiliation_strings":["University of South Florida, Tampa, FL, USA","University of South Florida Tampa, Florida"],"affiliations":[{"raw_affiliation_string":"University of South Florida, Tampa, FL, USA","institution_ids":["https://openalex.org/I2613432"]},{"raw_affiliation_string":"University of South Florida Tampa, Florida","institution_ids":["https://openalex.org/I2613432"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018105292","display_name":"Hao Zheng","orcid":"https://orcid.org/0000-0002-8627-0591"},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hao Zheng","raw_affiliation_strings":["University of South Florida, Tampa, FL, USA","University of South Florida Tampa, Florida"],"affiliations":[{"raw_affiliation_string":"University of South Florida, Tampa, FL, USA","institution_ids":["https://openalex.org/I2613432"]},{"raw_affiliation_string":"University of South Florida Tampa, Florida","institution_ids":["https://openalex.org/I2613432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074924343"],"corresponding_institution_ids":["https://openalex.org/I2613432"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1293644,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2619","issue":null,"first_page":"50","last_page":"57"},"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9939000010490417,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.991100013256073,"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.9504249095916748},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.830657958984375},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.8248151540756226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.743606448173523},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6679178476333618},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4937504231929779},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.491359144449234},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4903254806995392},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4133767783641815},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4077589511871338},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17980605363845825},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.1700754463672638},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15297392010688782}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9504249095916748},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.830657958984375},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.8248151540756226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.743606448173523},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6679178476333618},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4937504231929779},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.491359144449234},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4903254806995392},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4133767783641815},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4077589511871338},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17980605363845825},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.1700754463672638},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15297392010688782},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"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/hldvt.2010.5496663","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2010.5496663","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International High Level Design Validation and Test Workshop (HLDVT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1488659932","https://openalex.org/W1508602846","https://openalex.org/W1590437595","https://openalex.org/W1983064190","https://openalex.org/W2095617372","https://openalex.org/W2098039922","https://openalex.org/W2118713304","https://openalex.org/W2130025446","https://openalex.org/W2136248572","https://openalex.org/W2137467159","https://openalex.org/W2137889577","https://openalex.org/W2143337647","https://openalex.org/W2340735175","https://openalex.org/W3023191323","https://openalex.org/W6629100741","https://openalex.org/W6681615444"],"related_works":["https://openalex.org/W4250225510","https://openalex.org/W1979520342","https://openalex.org/W2884574904","https://openalex.org/W3187071876","https://openalex.org/W2172190585","https://openalex.org/W3141316173","https://openalex.org/W1572578464","https://openalex.org/W149700981","https://openalex.org/W2513478072","https://openalex.org/W1959575449"],"abstract_inverted_index":{"Even":[0],"though":[1],"BDD-based":[2],"reachability":[3],"analysis":[4],"can":[5],"handle":[6],"many":[7],"large":[8],"designs,":[9],"the":[10,52,68,77,82,86,109,115],"BDD":[11],"sizes":[12],"still":[13],"often":[14],"explode,":[15],"and":[16],"its":[17],"performance":[18,116],"is":[19,74,117],"hard":[20],"to":[21,33,50,57,100],"predict.":[22],"To":[23],"address":[24],"this":[25,94],"problem,":[26],"several":[27],"decomposed":[28],"approaches":[29,44],"are":[30,88],"presented":[31],"in":[32],"perform":[34],"approximate":[35],"state":[36,78,103],"space":[37,104],"traversal":[38],"on":[39,114],"a":[40],"partitioned":[41],"design.":[42],"These":[43],"use":[45],"reachable":[46],"states":[47],"as":[48],"invariants":[49],"constrain":[51],"inputs":[53,87],"of":[54,71,96,111],"each":[55,72,106],"partition":[56,73],"reduce":[58],"unreachable":[59],"states.":[60],"This":[61],"paper":[62],"presents":[63],"an":[64],"improvement":[65],"such":[66],"that":[67,93],"input":[69,97],"behavior":[70],"constrained":[75],"by":[76,81],"transitions":[79],"allowed":[80],"source":[83],"partitions":[84],"where":[85],"defined.":[89],"Experimental":[90],"results":[91],"show":[92],"type":[95],"constraints":[98],"helps":[99],"produce":[101],"tighter":[102],"for":[105],"partition.":[107],"Furthermore,":[108],"effect":[110],"design":[112],"partitioning":[113],"also":[118],"discussed.":[119]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}