{"id":"https://openalex.org/W2140583071","doi":"https://doi.org/10.1109/iscas.2005.1465061","title":"Linear-Time Algorithm for Computing Minimum Checkpoint Sets for Simulation-Based Verification of HDL Programs","display_name":"Linear-Time Algorithm for Computing Minimum Checkpoint Sets for Simulation-Based Verification of HDL Programs","publication_year":2005,"publication_date":"2005-07-27","ids":{"openalex":"https://openalex.org/W2140583071","doi":"https://doi.org/10.1109/iscas.2005.1465061","mag":"2140583071"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2005.1465061","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2005.1465061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE International Symposium on Circuits and Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5011438358","display_name":"Elena Dubrova","orcid":"https://orcid.org/0000-0001-7382-9408"},"institutions":[{"id":"https://openalex.org/I4210105561","display_name":"Institute for Management of Innovation and Technology","ror":"https://ror.org/01cnprv20","country_code":"SE","type":"facility","lineage":["https://openalex.org/I4210105561"]},{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"E. Dubrova","raw_affiliation_strings":["Royal Institute of Technology, IMIT/KTH, Kista, Sweden","IMIT/KTH, R. Inst. of Technol., Kista, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Royal Institute of Technology, IMIT/KTH, Kista, Sweden","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"IMIT/KTH, R. Inst. of Technol., Kista, Sweden","institution_ids":["https://openalex.org/I4210105561"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011438358"],"corresponding_institution_ids":["https://openalex.org/I4210105561","https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2212","last_page":"2215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9998999834060669,"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/T12810","display_name":"Real-time simulation and control systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7834841012954712},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.58821040391922},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5458718538284302},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48606494069099426},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.4693038761615753},{"id":"https://openalex.org/keywords/test-suite","display_name":"Test suite","score":0.4599773585796356},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40038779377937317},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39125531911849976},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2879906892776489},{"id":"https://openalex.org/keywords/test-case","display_name":"Test case","score":0.27828362584114075},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23676791787147522}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7834841012954712},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.58821040391922},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5458718538284302},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48606494069099426},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.4693038761615753},{"id":"https://openalex.org/C151552104","wikidata":"https://www.wikidata.org/wiki/Q7705809","display_name":"Test suite","level":4,"score":0.4599773585796356},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40038779377937317},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39125531911849976},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2879906892776489},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.27828362584114075},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23676791787147522},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C152877465","wikidata":"https://www.wikidata.org/wiki/Q208042","display_name":"Regression analysis","level":2,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2005.1465061","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2005.1465061","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE International Symposium on Circuits and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W127224647","https://openalex.org/W1540120102","https://openalex.org/W1554885925","https://openalex.org/W1910771831","https://openalex.org/W1976357819","https://openalex.org/W1985245264","https://openalex.org/W2003310968","https://openalex.org/W2003312024","https://openalex.org/W2011645538","https://openalex.org/W2047881370","https://openalex.org/W2049105156","https://openalex.org/W2092576944","https://openalex.org/W2105791428","https://openalex.org/W2111379929","https://openalex.org/W2124339980","https://openalex.org/W2132264164","https://openalex.org/W2132796821","https://openalex.org/W2134836602","https://openalex.org/W2160504889","https://openalex.org/W2912111225"],"related_works":["https://openalex.org/W2356948891","https://openalex.org/W1480521623","https://openalex.org/W2107309132","https://openalex.org/W2028796071","https://openalex.org/W3180921142","https://openalex.org/W1998393968","https://openalex.org/W2521771266","https://openalex.org/W2615067872","https://openalex.org/W4206563238","https://openalex.org/W2120620598"],"abstract_inverted_index":{"Simulation-based":[0],"verification":[1],"is":[2,12,40],"a":[3,16,37,57,61,87,93,101,106],"popular":[4],"method":[5],"for":[6,59,90,104],"functional":[7],"validation":[8],"of":[9,18,36,45,63,74,116,121],"hardware.":[10],"It":[11],"performed":[13],"by":[14,42,49,85],"applying":[15],"set":[17,73,109],"tests":[19,75],"to":[20,26],"the":[21,32,43,46,50,64,69,78,81,91,117,122,126],"system":[22,47],"under":[23],"consideration":[24],"and":[25,30,113],"its":[27],"reference":[28],"model,":[29],"comparing":[31],"results.":[33],"The":[34],"effectiveness":[35],"test":[38,88],"suite":[39],"measured":[41],"fraction":[44],"covered":[48],"tests.":[51],"In":[52],"this":[53],"paper,":[54],"we":[55],"present":[56,100],"technique":[58],"selecting":[60],"part":[62],"system,":[65],"called":[66],"checkpoints,":[67,92],"with":[68],"property":[70],"that":[71],"any":[72],"which":[76],"covers":[77,80],"checkpoints":[79],"entire":[82],"system.":[83,127],"Thus,":[84],"constructing":[86],"suit":[89],"100%":[94],"coverage":[95],"can":[96],"be":[97],"achieved.":[98],"We":[99],"linear-time":[102],"algorithm":[103],"computing":[105],"minimum":[107],"checkpoint":[108],"based":[110],"on":[111],"pre-":[112],"post-dominator":[114],"relations":[115],"control":[118],"flow":[119],"graph":[120],"HDL":[123],"program":[124],"representing":[125]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}