Nothing Special   »   [go: up one dir, main page]

skip to main content
10.5555/2132325.2132460acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
research-article

Debugging with dominance: on-the-fly RTL debug solution implications

Published: 07 November 2011 Publication History

Abstract

Design debugging has become a resource-intensive bottleneck in modern VLSI CAD flows, consuming as much as 60% of the total verification effort. With typical design sizes exceeding the half-million synthesized gates mark, the growing number of blocks to be examined dramatically slows down the debugging process. The aim of this work is to prune the number of debugging iterations for finding all potential bugs, without affecting the debugging resolution. This is achieved by using structural dominance relationships between circuit components. More specifically, an iterative fixpoint algorithm is presented for finding dominance relationships between multiple-output blocks of the design. These relationships are then leveraged for the early discovery of potential bugs, along with their corrections, resulting in significant debugging speed-ups. Extensive experiments on real industrial designs show that 66% of solutions are discovered early due to dominator implications. This results in consistent performance gains in all cases and a 1.7x overall speed-up for finding all potential bugs, demonstrating the robustness and practicality of the proposed approach.

References

[1]
H. Foster, "Assertion-based verification: Industry myths to realities (invited tutorial)," in Computer Aided Verification, 2008, pp. 5--10.
[2]
M. Abramovici, M. Breuer, and A. Friedman, Digital Systems Testing and Testable Design. Computer Science Press, 1990.
[3]
S. Huang and K. Cheng, Formal Equivalence Checking and Design Debugging. Kluwer Academic Publisher, 1998.
[4]
A. Smith, A. Veneris, M. F. Ali, and A. Viglas, "Fault diagnosis and logic debugging using Boolean satisfiability," IEEE Trans. on CAD, vol. 24, no. 10, pp. 1606--1621, 2005.
[5]
H. Mangassarian, A. Veneris, and M. Benedetti, "Robust QBF encodings for sequential circuits with applications to verification, debug, and test," IEEE Trans. on Computers, vol. 59, no. 7, pp. 981--994, 2010.
[6]
Y. Chen, S. Safarpour, J. Marques-Silva, and A. Veneris, "Automated design debugging with maximum satisfiability," IEEE Trans. on CAD, vol. 29, pp. 1804--1817, November 2010.
[7]
S. Alstrup, D. Harel, P. W. Lauridsen, and M. Thorup, "Dominators in linear time," SIAM J. Comput., vol. 28, no. 6, pp. 2117--2132, 1999.
[8]
L. Georgiadis and R. E. Tarjan, "Finding dominators revisited: extended abstract," in SODA, 2004, pp. 869--878.
[9]
T. Kirkland and M. R. Mercer, "A topological search algorithm for ATPG," in Design Automation Conf., 1987, pp. 502--508.
[10]
T. Niermann and J. H. Patel, "Hitec: a test generation package for sequential circuits," in European Design Automation Conf., 1991, pp. 214--218.
[11]
M. F. Ali, S. Safarpour, A. Veneris, M. Abadir, and R. Drechsler, "Post-verification debugging of hierarchical designs," in Int'l Conf. on CAD, 2005, pp. 871--876.
[12]
S. Safarpour and A. Veneris, "Automated design debugging with abstraction and refinement," IEEE Trans. on CAD, vol. 28, no. 10, pp. 1597--1608, 2009.
[13]
R. Gupta, "Generalized dominators and post-dominators," in Symposium on Principles of Programming Languages, 1992, pp. 246--257.
[14]
S. Alstrup, J. Clausen, and K. Jørgensen, "An O(|V|*|E|) algorithm for finding immediate multiple-vertex dominators," Inf. Process. Lett., vol. 59, no. 1, pp. 9--11, 1996.
[15]
R. Krenz and E. Dubrova, "A fast algorithm for finding common multiple-vertex dominators in circuit graphs," in ASP Design Automation Conf., 2005, pp. 529--532.
[16]
M. Ganai and A. Gupta, "Efficient BMC for multi-clock systems with clocked specifications," in ASP Design Automation Conf., 2007, pp. 310--315.
[17]
K. Cooper, T. Harvey, and K. Kennedy, "A simple, fast dominance algorithm," Software Practice & Experience, vol. 4, pp. 1--10, 2001.
[18]
A. Veneris, B. Keng, and S. Safarpour, "From RTL to silicon: the case for automated debug," in ASP Design Automation Conf., 2011, pp. 306--310.
[19]
M. Benedetti, A. Lallouet, and J. Vautard, "QCSP made practical by virtue of restricted quantification," in International Joint Conference on Artificial Intelligence, 2007, pp. 38--43.
[20]
F. E. Allen and J. Cocke, "Graph-theoretic constructs for program flow analysis," Technical Report RC 3923 (17789), IBM Thomas J. Watson Research Center, Tech. Rep., 1972.
[21]
J. Kam and J. Ullman, "Global data flow analysis and iterative algorithms," Journal of the ACM, vol. 23, no. 1, pp. 158--171, 1976.
[22]
A. V. Aho, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques and Tools. Addison Wesley, 1986.
[23]
N. Eén and N. Sörensson, "An extensible SAT-solver," in Int'l Conf. on Theory and Applications of Satisfiability Testing, 2003, pp. 502--518.
[24]
OpenCores.org, "http://www.opencores.org," 2007.

Cited By

View all
  • (2012)Non-solution implications using reverse domination in a modern SAT-based debugging environmentProceedings of the Conference on Design, Automation and Test in Europe10.5555/2492708.2492867(629-634)Online publication date: 12-Mar-2012

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '11: Proceedings of the International Conference on Computer-Aided Design
November 2011
844 pages
ISBN:9781457713989
  • General Chair:
  • Joel Phillips,
  • Program Chairs:
  • Alan J. Hu,
  • Helmut Graeb

Sponsors

Publisher

IEEE Press

Publication History

Published: 07 November 2011

Check for updates

Qualifiers

  • Research-article

Conference

ICCAD '11
Sponsor:

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 22 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2012)Non-solution implications using reverse domination in a modern SAT-based debugging environmentProceedings of the Conference on Design, Automation and Test in Europe10.5555/2492708.2492867(629-634)Online publication date: 12-Mar-2012

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media