An optimum algorithm for compacting error traces for efficient design error debugging
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
1366 | en_US |
dc.citation.issue |
11 | en_US |
dc.citation.spage |
1356 | en_US |
dc.citation.volume |
55 | en_US |
dc.contributor.author |
Yen, Chia-Chih | en_US |
dc.contributor.author |
Jou, Jing-Yang | en_US |
dc.contributor.department |
電子工程學系及電子研究所 | zh_TW |
dc.contributor.department |
Department of Electronics Engineering and Institute of Electronics | en_US |
dc.date.accessioned |
2014-12-08T15:15:32Z | |
dc.date.available |
2014-12-08T15:15:32Z | |
dc.date.issued |
2006-11-01 | en_US |
dc.description.abstract |
Diagnosing counterexamples with error traces has acted as one of the most critical steps in functional verification. Unfortunately, error traces are normally very lengthy such that designers need to spend considerable effort to understand them. To alleviate the designers' burden for debugging, we present a SAT-based algorithm for reducing the lengths of error traces. The algorithm performs the paradigm of the binary search algorithm to halve the search space recursively. Furthermore, it applies a novel theorem to guarantee gaining the shortest lengths for the error traces. Based on the optimum algorithm, we develop two robust heuristics to handle real designs. Experimental results demonstrate that our approaches greatly surpass previous work and, indeed, have promising solutions. | en_US |
dc.identifier.doi |
10.1109/TC.2006.174 | en_US |
dc.identifier.issn |
0018-9340 | en_US |
dc.identifier.journal |
IEEE TRANSACTIONS ON COMPUTERS | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1109/TC.2006.174 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/11627 | |
dc.identifier.wosnumber |
WOS:000240634900006 | |
dc.language.iso |
en_US | en_US |
dc.subject |
verification | en_US |
dc.subject |
simulation | en_US |
dc.subject |
diagnosis | en_US |
dc.subject |
error checking | en_US |
dc.subject |
satisfiability | en_US |
dc.title |
An optimum algorithm for compacting error traces for efficient design error debugging | en_US |
dc.type |
Article; Proceedings Paper | en_US |
檔案
- 000240634900006.pdf (3.15 MB, Adobe PDF)
所屬典藏: 會議論文