Sciweavers

3 search results - page 1 / 1
» Simulation Bounds for Equivalence Verification of Polynomial...
Sort
View
TVLSI
2008
72views more  TVLSI 2008»
13 years 4 months ago
Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra
Namrata Shekhar, Priyank Kalla, M. Brandon Meredit...
ICCAD
2005
IEEE
160views Hardware» more  ICCAD 2005»
14 years 1 months ago
Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra
— This paper addresses the problem of equivalence verification of RTL descriptions. The focus is on datapathoriented designs that implement polynomial computations over fixed-s...
Namrata Shekhar, Priyank Kalla, Florian Enescu, Si...
CADE
2005
Springer
14 years 5 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard