Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra. - Namrata Shekhar; Priyank Kalla; Florian Enescu; Sivaram Gopalakrishnan (ICCAD, 2005)

Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths. - Namrata Shekhar; Priyank Kalla; Sivaram Gopalakrishnan; Florian Enescu (ICCD, 2005)

Equivalence verification of arithmetic datapaths with multiple word-length operands. - Namrata Shekhar; Priyank Kalla; Florian Enescu (DATE, 2006)

Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands. - Namrata Shekhar; Priyank Kalla; M. Brandon Meredith; Florian Enescu (FMCAD, 2006)

Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing. - Namrata Shekhar; Sudhakar Kalla; Florian Enescu (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2007)

Verification of arithmetic datapaths using polynomial function models and congruence solving. - Neal Tew; Priyank Kalla; Namrata Shekhar; Sivaram Gopalakrishnan (ICCAD, 2008)

Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra. - Namrata Shekhar; Priyank Kalla; M. Brandon Meredith; Florian Enescu (IEEE Trans. Very Large Scale Integr. Syst., 2008)