This paper proposes a new approach for proving arithmetic correctness of data paths in System-on-Chip modules. It complements existing techniques which are, for reasons of complexity, restricted to verifying only the control behavior. The circuit is modeled at the arithmetic bit level (ABL) so that our approach is well adapted to current industrial design styles for high performance data paths. Normalization at the ABL is combined with the techniques of computer algebra. We compute normal forms with respect to Gröbner bases over rings ℤ/ 〈2n〉. Our approach proves tractable for industrial data path designs where standard property checking techniques fail. © 2008 Springer-Verlag.
CITATION STYLE
Wienand, O., Wedler, M., Stoffel, D., Kunz, W., & Greuel, G. M. (2008). An algebraic approach for proving data correctness in arithmetic data paths. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5123 LNCS, pp. 473–486). https://doi.org/10.1007/978-3-540-70545-1_45
Mendeley helps you to discover research relevant for your work.