Translation validation of high-level synthesis

  • Authors:

  • Sudipta Kundu;Sorin Lerner;Rajesh K. Gupta

  • Affiliations:

  • Synopsys, Inc., Hillsboro, OR;Department of Computer Science and Engineering, University of California, San Diego, CA;Department of Computer Science and Engineering, University of California, San Diego, CA

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

Quantified Score

Hi-index 0.03

Visualization

Abstract

The growing complexity of systems and their implementation into silicon encourages designers to look for ways to model designs at higher levels of abstraction and then incrementally build portions of these designs--automatically or manually--from these high-level specifications. Unfortunately, this translation process itself can be buggy, which can create a mismatch between what a designer intends and what is actually implemented in the circuit. Therefore, checking if the implementation is a refinement or equivalent to its initial specification is of tremendous value. In this paper, we present an approach to automatically validate the implementation against its initial high-level specification using insights from translation validation, automated theorem proving, and relational approaches to reasoning about programs. In our experiments, we first focus on concurrent systems modeled as communicating sequential processes and show that their refinements can be validated using our approach. Next, we have applied our validation approach to a realistic scenario--a parallelizing high-level synthesis framework called Spark. We present the details of our algorithm and experimental results.