ACM Home Page
Please provide us with feedback. Feedback
Advanced techniques for RTL debugging
Full text PdfPdf (359 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 40th annual Design Automation Conference table of contents
Anaheim, CA, USA
SESSION: Testbench, verification and debugging: practical considerations table of contents
Pages: 362 - 367  
Year of Publication: 2003
ISBN:1-58113-688-9
Authors
Yu-Chin Hsu  Novas Software Inc., San Jose, CA
Bassam Tabbara  Novas Software Inc., San Jose, CA
Yirng-An Chen  Novas Software Inc., San Jose, CA
Furshing Tsai  Novas Software Inc., San Jose, CA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 31,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/775832.775927
What is a DOI?

ABSTRACT

Conventional register transfer level (RTL) debugging is based on overlaying simulation results on structural connectivity information of the Hardware Description Language (HDL) source. This process is helpful in locating errors but does little to help designers reason about the how and why. Designers usually have to build a mental image of how data is propagated and used over the simulation run. As designs get more and more complex, there is a need to facilitate this reasoning process, and automate the debugging. In this paper, we present innovative debug techniques to address this shortage in adequate facilities for reasoning about behavior, and debugging errors. Our approach delivers significant technology advances in RTL debugging; it is the first comprehensive and methodical approach of its kind that extracts, analyzes, traces, explores, and queries a design's multi-cycle temporal behavior. We show how our automatic tracing scheme can shorten debugging time by orders of magnitude for unfamiliar designs. We also demonstrate how the advanced debug techniques reduce the number of regression iterations.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
 
4
OpenVera Assertions, www.open-vera.com <http://www.open-vera.com>, 2002.
 
5
Sugar PSL, www.accellera.org <http://www.accellera.org>, 2002
 
6
Temporal E assertion constructs, Verisity Inc., 2002.
 
7
Vardi, Moshe "Branching Time vs. Linear Time: Final Showdown", ETAPS, 2001.
 
8
Vardi, Moshe "The ForSpec Temporal Language: A New Temporal Property-Specification Language", TACAS, 2002.
 
9
Weiser, Mark "Program Slicing", IEEE Transcations on Software Engineering, 10:352--357, July 1984.


Collaborative Colleagues:
Yu-Chin Hsu: colleagues
Bassam Tabbara: colleagues
Yirng-An Chen: colleagues
Furshing Tsai: colleagues