Document Type

Pre-Print

Publication Date

2014

Subjects

System design -- Data processing, Electronic systems -- Design and construction, Computer architecture -- Algorithms

Abstract

Behavioral synthesis involves compiling an Electronic System-Level (ESL) design into its RegisterTransfer Level (RTL) implementation. Loop pipelining is one of the most critical and complex transformations employed in behavioral synthesis. Certifying the loop pipelining algorithm is challenging because there is a huge semantic gap between the input sequential design and the output pipelined implementation making it infeasible to verify their equivalence with automated sequential equivalence checking techniques. We discuss our ongoing effort using ACL2 to certify loop pipelining transformation. The completion of the proof is work in progress. However, some of the insights developed so far may already be of value to the ACL2 community. In particular, we discuss the key invariant we formalized, which is very different from that used in most pipeline proofs. We discuss the needs for this invariant, its formalization in ACL2, and our envisioned proof using the invariant. We also discuss some trade-offs, challenges, and insights developed in course of the project.

Description

© D. Puri, S. Ray, K. Hao & F. Xie This work is licensed under the Creative Commons Attribution License.

Subsequently appeared in Proceedings ACL2 2014, arXiv:1406.1238.

DOI

10.4204/EPTCS.152.10

Persistent Identifier

http://archives.pdx.edu/ds/psu/20922

Share

COinS