{"id":"https://openalex.org/W2771599637","doi":"https://doi.org/10.1109/hldvt.2017.8167457","title":"Reachability analysis in RTL circuits using k-induction bounded model checking","display_name":"Reachability analysis in RTL circuits using k-induction bounded model checking","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2771599637","doi":"https://doi.org/10.1109/hldvt.2017.8167457","mag":"2771599637"},"language":"en","primary_location":{"id":"doi:10.1109/hldvt.2017.8167457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2017.8167457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5004567147","display_name":"Tonmoy Roy","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Tonmoy Roy","raw_affiliation_strings":["Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia"],"affiliations":[{"raw_affiliation_string":"Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108516165","display_name":"Michael S. Hsiao","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Hsiao","raw_affiliation_strings":["Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia"],"affiliations":[{"raw_affiliation_string":"Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, Virginia","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004567147"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.2101054,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"9","last_page":"16"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9995999932289124,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8405625224113464},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.8101750612258911},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7411507368087769},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6540637612342834},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5992684960365295},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5505750179290771},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5277262926101685},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5002012252807617},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.49714091420173645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49037766456604004},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.45408323407173157},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.375213623046875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18157649040222168}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8405625224113464},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.8101750612258911},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7411507368087769},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6540637612342834},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5992684960365295},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5505750179290771},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5277262926101685},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5002012252807617},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.49714091420173645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49037766456604004},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.45408323407173157},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.375213623046875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18157649040222168},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hldvt.2017.8167457","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hldvt.2017.8167457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1494930385","https://openalex.org/W1495266209","https://openalex.org/W1548254758","https://openalex.org/W1555915743","https://openalex.org/W1819209966","https://openalex.org/W1889756448","https://openalex.org/W1965514683","https://openalex.org/W1982205631","https://openalex.org/W1986193117","https://openalex.org/W2046239089","https://openalex.org/W2083910479","https://openalex.org/W2101476216","https://openalex.org/W2101811680","https://openalex.org/W2102691476","https://openalex.org/W2106957508","https://openalex.org/W2111979321","https://openalex.org/W2127637733","https://openalex.org/W2143744297","https://openalex.org/W2160953336","https://openalex.org/W2293624369","https://openalex.org/W3149357776","https://openalex.org/W4244517018","https://openalex.org/W6676590341"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W2152752131","https://openalex.org/W2122355433","https://openalex.org/W2106507440","https://openalex.org/W2105710452","https://openalex.org/W2162615969","https://openalex.org/W1547517160","https://openalex.org/W1483297389","https://openalex.org/W2137328468","https://openalex.org/W2158533859"],"abstract_inverted_index":{"In":[0,40],"the":[1,14,25,32,60,63,75,87,111,116,119,124,132],"system":[2],"on":[3],"chip":[4],"design":[5],"process,":[6],"functional":[7,21],"validation":[8,22],"is":[9,23,96],"regarded":[10],"as":[11,31],"one":[12],"of":[13,27,34,62,78,110,118,126],"main":[15],"challenges.":[16],"One":[17],"sub":[18],"problem":[19],"in":[20,129],"proving":[24,59,123],"unsatisfiability":[26,61],"certain":[28],"properties":[29],"such":[30],"reachability":[33],"some":[35],"assertions":[36],"or":[37],"code":[38],"blocks.":[39],"this":[41,79,93],"work,":[42],"we":[43],"present":[44],"a":[45,52],"induction-based":[46],"bounded":[47],"model":[48],"checking":[49],"technique":[50],"using":[51,66],"Satisfiability":[53],"Modulo":[54],"Theories":[55],"(SMT)":[56],"solver":[57],"for":[58],"properties.":[64],"After":[65],"program":[67],"slicing":[68],"to":[69,85,98,105],"generate":[70],"small":[71],"sized":[72],"SMT":[73],"formulas,":[74],"novel":[76],"idea":[77,121],"work":[80],"utilizes":[81],"signal":[82],"domain":[83],"constraints":[84],"make":[86],"induction":[88],"step":[89],"more":[90],"powerful.":[91],"With":[92],"approach":[94],"it":[95],"possible":[97],"categorize":[99],"branches":[100,128],"that":[101],"are":[102],"otherwise":[103],"impossible":[104],"reach":[106],"with":[107],"existing":[108],"state":[109],"art":[112],"algorithms.":[113],"We":[114],"demonstrate":[115],"effectiveness":[117],"proposed":[120],"by":[122],"unreachability":[125],"various":[127],"ITC'99":[130],"and":[131],"IWLS":[133],"benchmark":[134],"circuits":[135],"which":[136],"were":[137],"previously":[138],"unresolved.":[139]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}