Abstract
This document describes how the FORTE STE-based formal verification system was used to verify the RTL implementation of an error control code. The error control code considered is linear: its encoder and decoder proceed by matrix multiplication. Although that function is in essence combinational, its implementation in a high-performance microprocessor is done in a pipelined fashion. The additional state elements introduced by the pipelining quickly push an SMV-style model checker to its capacity limits. With the case-study presented in this document, we show that an STE-style model checker is better suited for this problem. We present two instances of the ECC verification problem. For the first we were able to combine an encoder and a decoder into one model for verification. For the second, such a combination was not possible and we resorted to verifying properties of a matrix that we extracted from the implementation.
Similar content being viewed by others
References
M. Aagaard, R. Jones, and C.-J. Seger, “Formal verification using parametric representations of Boolean constraints,” in Proc. 36th Desigh Automation Conf., 1999.
P. Jain and G. Gopalakrishnan, “Efficient symbolic simulation-based verification using the parametric form of Boolean expressions,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 13, No. 8, pp. 1005–1015, 1994.
R. Jones, J. O'Leary, C.-J. Seger, M. Aagaard, and T. Melham, “Practical formal verification in microprocessor design,” IEEE Design and Test of Computers, Vol. 18, No. 4, pp. 16–25, 2001.
K. McMillan, Symbolic Model Checking, Kluwer Academic Publishers, 1993.
C.-J. Seger, “VOSS—A formal hardware verification system user's guide,” Technical report, University of British Columbia, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Amagbegnon, T.P., Barkai, U.E. Verifying the Implementation of an Error Control Code. Formal Methods in System Design 22, 155–161 (2003). https://doi.org/10.1023/A:1022925623072
Issue Date:
DOI: https://doi.org/10.1023/A:1022925623072