Post-verification debugging of hierarchical designs

  • Authors:
  • M. F. Ali;S. Safarpour;A. Veneris;M. S. Abadir;R. Drechsler

  • Affiliations:
  • Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada;Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada;Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada;Dept. of Electr. Eng., California Univ., Riverside, CA, USA;Arizona Univ., Tucson, AZ, USA

  • Venue:
  • ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

As VLSI designs grow in complexity and size, errors become more frequent and difficult to track. Recent developments have automated most of the verification tasks but debugging still remains a resource-intensive, manually conducted procedure. This paper bridges this gap as it develops robust automated debugging methodologies that complement verification processes. Unlike prior debugging techniques, the proposed one exploits the hierarchical nature of modern designs to improve the performance and quality of debugging. It also formulates the problem in terms of Quantified Boolean Formula Satisfiability to obtain dramatic reduction in memory requirements, which allows for debugging of large designs. Extensive experiments conducted on industrial and benchmark designs confirm the efficiency and practicality of the proposed approach.