{"id":"https://openalex.org/W4230767135","doi":"https://doi.org/10.1109/iccad.2005.1560219","title":"Transition-by-transition FSM traversal for reachability analysis in bounded model checking","display_name":"Transition-by-transition FSM traversal for reachability analysis in bounded model checking","publication_year":2005,"publication_date":"2005-12-22","ids":{"openalex":"https://openalex.org/W4230767135","doi":"https://doi.org/10.1109/iccad.2005.1560219"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2005.1560219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2005.1560219","pdf_url":null,"source":{"id":"https://openalex.org/S4363608058","display_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","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":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","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/A5045108881","display_name":"Minh Duc Nguyen","orcid":"https://orcid.org/0000-0003-4702-0888"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"M.D. Nguyen","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047920654","display_name":"Dominik Stoffel","orcid":"https://orcid.org/0000-0002-8180-9738"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"D. Stoffel","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020337959","display_name":"Markus Wedler","orcid":null},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. Wedler","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066184879","display_name":"Wolfgang Kunz","orcid":"https://orcid.org/0000-0002-6612-2946"},"institutions":[{"id":"https://openalex.org/I153267046","display_name":"University of Kaiserslautern","ror":"https://ror.org/04zrf7b53","country_code":"DE","type":"education","lineage":["https://openalex.org/I153267046"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"W. Kunz","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Kaiserslautern, Germany","institution_ids":["https://openalex.org/I153267046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5045108881"],"corresponding_institution_ids":["https://openalex.org/I153267046"],"apc_list":null,"apc_paid":null,"fwci":0.7994,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7251462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1068","last_page":"1075"},"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/T11005","display_name":"Radiation Effects in Electronics","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9898999929428101,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9497259855270386},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7818063497543335},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7414400577545166},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7163376212120056},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6840661764144897},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5588757991790771},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.5285364985466003},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.48758572340011597},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4697190821170807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46498578786849976},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.44784536957740784},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.42604148387908936},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4234468638896942},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3115939795970917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1486717164516449},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1155070960521698}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9497259855270386},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7818063497543335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7414400577545166},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7163376212120056},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6840661764144897},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5588757991790771},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.5285364985466003},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.48758572340011597},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4697190821170807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46498578786849976},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.44784536957740784},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.42604148387908936},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4234468638896942},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3115939795970917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1486717164516449},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1155070960521698},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2005.1560219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2005.1560219","pdf_url":null,"source":{"id":"https://openalex.org/S4363608058","display_name":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","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":"ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W164685601","https://openalex.org/W1521761735","https://openalex.org/W1536007121","https://openalex.org/W1569691571","https://openalex.org/W1683908335","https://openalex.org/W1983064190","https://openalex.org/W1986558678","https://openalex.org/W2109602825","https://openalex.org/W2113251992","https://openalex.org/W2137889577","https://openalex.org/W2143337647","https://openalex.org/W2151398141","https://openalex.org/W2154967452","https://openalex.org/W2156116570","https://openalex.org/W2158395308","https://openalex.org/W2161677825","https://openalex.org/W2161999969","https://openalex.org/W3149523047","https://openalex.org/W4235197231","https://openalex.org/W4235647260","https://openalex.org/W4243540980","https://openalex.org/W4256412896","https://openalex.org/W6606735704","https://openalex.org/W6631141576","https://openalex.org/W6680600072","https://openalex.org/W6681615444","https://openalex.org/W6682383673"],"related_works":["https://openalex.org/W4250225510","https://openalex.org/W1979520342","https://openalex.org/W2101260249","https://openalex.org/W1583463005","https://openalex.org/W2149313960","https://openalex.org/W2624100179","https://openalex.org/W1860618800","https://openalex.org/W2139480393","https://openalex.org/W2396827500","https://openalex.org/W2122050999"],"abstract_inverted_index":{"In":[0],"bounded":[1],"model":[2],"checking":[3],"(BMC)-based":[4],"verification":[5,24,127],"flows":[6],"lack":[7],"of":[8,22,47,74,92,103,109,126],"reachability":[9,30,60],"constraints":[10,31,61],"often":[11],"leads":[12],"to":[13,26,52,58,67],"false":[14],"negatives.":[15],"At":[16],"present,":[17],"it":[18],"is":[19,50,77],"daily":[20],"practice":[21],"a":[23,45,68,80],"engineer":[25],"identify":[27],"the":[28,35,72,75,89,93,100,104,110,117,123],"missing":[29],"by":[32,39,79,106],"manually":[33],"inspecting":[34],"design":[36,69,76],"code":[37],"and":[38,49,98],"analyzing":[40],"counterexamples.":[41],"This,":[42],"unfortunately,":[43],"requires":[44],"lot":[46],"effort":[48],"prone":[51],"errors.":[53],"We":[54],"propose":[55],"an":[56],"algorithm":[57,96],"determine":[59],"automatically.":[62],"The":[63,95],"proposed":[64,118],"approach":[65],"applies":[66],"style":[70],"where":[71],"operation":[73],"controlled":[78],"main":[81,111],"FSM":[82],"which":[83],"can":[84,120],"easily":[85],"be":[86],"extracted":[87],"from":[88],"RTL":[90],"description":[91],"circuit.":[94],"decomposes":[97],"analyzes":[99],"state":[101],"space":[102],"circuit":[105],"considering":[107],"transitions":[108],"FSM.":[112],"Experimental":[113],"results":[114],"show":[115],"that":[116],"method":[119],"considerably":[121],"reduce":[122],"manual":[124],"work":[125],"engineers.":[128]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}