Automated design debugging with maximum satisfiability

  • Authors:
  • Yibin Chen;Sean Safarpour;Joao Marques-Silva;Andreas Veneris

  • Affiliations:
  • Vennsa Technologies, Inc., Toronto, ON, Canada;Vennsa Technologies, Inc., Toronto, ON, Canada;School of Electronics and Computer Science, University College Dublin, Belfield, Dublin, Ireland;Department of Computer Science and the Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada

  • Venue:
  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.03

Visualization

Abstract

As contemporary very large scale integration designs grow in complexity, design debugging has rapidly established itself as one of the largest bottlenecks in the design cycle today. Automated debug solutions such as those based on Boolean satisfiability (SAT) enable engineers to reduce the debug effort by localizing possible error sources in the design. Unfortunately, adaptation of these techniques to industrial designs is still limited by the performance and capacity of the underlying engines. This paper presents a novel formulation of the debugging problem using MaxSAT to improve the performance and applicability of automated debuggers. Our technique not only identifies errors in the design but also indicates when the bug is excited in the error trace. MaxSAT allows for a simpler formulation of the debugging problem, reducing the problem size by 80% compared to a conventional SAT-based technique. Empirical results demonstrate the effectiveness of the proposed formulation as run-time improvements of 4.5× are observed on average. This paper introduces two performance improvements to further reduce the time required to find all error sources within the design by an order of magnitude.