標題: | An optimum algorithm for compacting error traces for efficient design error debugging |
作者: | Yen, Chia-Chih Jou, Jing-Yang 電子工程學系及電子研究所 Department of Electronics Engineering and Institute of Electronics |
關鍵字: | verification;simulation;diagnosis;error checking;satisfiability |
公開日期: | 1-十一月-2006 |
摘要: | 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. |
URI: | http://dx.doi.org/10.1109/TC.2006.174 http://hdl.handle.net/11536/11627 |
ISSN: | 0018-9340 |
DOI: | 10.1109/TC.2006.174 |
期刊: | IEEE TRANSACTIONS ON COMPUTERS |
Volume: | 55 |
Issue: | 11 |
起始頁: | 1356 |
結束頁: | 1366 |
顯示於類別: | 會議論文 |