{"id":"https://openalex.org/W1997348938","doi":"https://doi.org/10.1145/1119772.1119792","title":"Algorithms for compacting error traces","display_name":"Algorithms for compacting error traces","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1997348938","doi":"https://doi.org/10.1145/1119772.1119792","mag":"1997348938"},"language":"en","primary_location":{"id":"doi:10.1145/1119772.1119792","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119772.1119792","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 conference on Asia South Pacific design automation  - ASPDAC","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/A5083397477","display_name":"Yirng-An Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yirng-An Chen","raw_affiliation_strings":["Novas Software Inc., San Jose, CA, USA"],"affiliations":[{"raw_affiliation_string":"Novas Software Inc., San Jose, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015151960","display_name":"Fang-Sung Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210158869","display_name":"Silicon Motion (Taiwan)","ror":"https://ror.org/05878p058","country_code":"TW","type":"company","lineage":["https://openalex.org/I4210158869"]},{"id":"https://openalex.org/I93085520","display_name":"Silicon Labs (United States)","ror":"https://ror.org/02dyqfb80","country_code":"US","type":"company","lineage":["https://openalex.org/I93085520"]}],"countries":["TW","US"],"is_corresponding":false,"raw_author_name":"Fang-Sung Chen","raw_affiliation_strings":["Silicon Integrated Systems Corp., Hsin Chu, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Silicon Integrated Systems Corp., Hsin Chu, Taiwan, R.O.C","institution_ids":["https://openalex.org/I93085520","https://openalex.org/I4210158869"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083397477"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6047,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.8887887,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"99","last_page":"99"},"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.9998000264167786,"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.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9991999864578247,"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/trace","display_name":"TRACE (psycholinguistics)","score":0.753329336643219},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6627013683319092},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6355268955230713},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6328586935997009},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.6012300848960876},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5339279174804688},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.528278648853302},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4379734992980957},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2689594030380249}],"concepts":[{"id":"https://openalex.org/C75291252","wikidata":"https://www.wikidata.org/wiki/Q1315756","display_name":"TRACE (psycholinguistics)","level":2,"score":0.753329336643219},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6627013683319092},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6355268955230713},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6328586935997009},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.6012300848960876},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5339279174804688},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.528278648853302},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4379734992980957},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2689594030380249},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1119772.1119792","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1119772.1119792","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2003 conference on Asia South Pacific design automation  - ASPDAC","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.387.7582","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.387.7582","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cecs.uci.edu/~papers/compendium94-03/papers/2003/aspdac03/pdffiles/01d_3.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.4574","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.4574","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-2.cs.cmu.edu/afs/cs/user/yachen/www/papers/aspdac2003.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1503170978","https://openalex.org/W1516339813","https://openalex.org/W2000557929","https://openalex.org/W2026584294","https://openalex.org/W2034797990","https://openalex.org/W2047650874","https://openalex.org/W2080267935","https://openalex.org/W2100112273","https://openalex.org/W2158966008","https://openalex.org/W2167435507","https://openalex.org/W2752885492","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2543101158","https://openalex.org/W1569638199","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294"],"abstract_inverted_index":{"Abstract":[0],"\u2014":[1],"In":[2],"this":[3],"paper,":[4],"we":[5],"present":[6],"a":[7],"concept":[8],"of":[9,28,55,77,87,174],"compacting":[10,56],"the":[11,26,35,41,53,57,69,74,78,84,93,113,118,126,147,153,156,172,192],"error":[12,21,58,79,115,149,175],"traces":[13,176],"generated":[14],"by":[15,91,96,129],"pseudo-random/random":[16],"simulations.":[17],"The":[18,163],"new":[19],"shorter":[20,154],"trace":[22,116],"not":[23],"only":[24],"decreases":[25],"time":[27,37,189],"user\u2019s":[29],"debugging":[30],"process":[31],"but":[32],"also":[33],"reduces":[34],"simulation":[36],"required":[38,186],"to":[39,51,67,72,110,145,190,198],"verify":[40],"bug":[42],"fixes.":[43],"Two":[44],"algorithms":[45,61,169],"CET1":[46,82],"and":[47,103],"CET2":[48,124,195],"are":[49,138,161],"presented":[50],"perform":[52],"task":[54],"trace.":[59,80,150],"Both":[60],"first":[62],"use":[63],"an":[64],"efficient":[65],"approach":[66],"eliminate":[68],"redundant":[70],"states":[71,76,90,95,128],"generate":[73],"unique":[75,89,101,134],"Then,":[81],"build":[83],"connected":[85,119],"graph":[86],"these":[88],"computing":[92],"reachable":[94,127],"one":[97,130],"cycle":[98,131],"for":[99,132,178],"each":[100],"state,":[102],"then":[104],"apply":[105],"Dijkstra\u2019s":[106,141],"shortest":[107,114,142,148,193],"path":[108,143],"algorithm":[109,144],"find":[111,146,191],"out":[112],"in":[117,140],"graph.":[120],"Compared":[121],"with":[122],"CET1,":[123],"computes":[125],"those":[133],"states,":[135],"when":[136],"they":[137],"needed":[139],"After":[151],"finding":[152],"trace,":[155,194],"corresponding":[157],"input/output":[158],"test":[159],"vectors":[160],"generated.":[162],"experimental":[164],"results":[165],"show":[166],"that":[167],"both":[168],"can":[170],"reduce":[171],"length":[173],"dramatically":[177],"most":[179],"cases":[180,185],"using":[181],"reasonable":[182],"memory.":[183],"For":[184],"longer":[187],"CPU":[188],"is":[196],"up":[197],"37":[199],"times":[200],"faster":[201],"than":[202],"CET1.":[203],"I.":[204]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}