Login / Signup

Efficient Gröbner Basis Reductions for Formal Verification of Galois Field Arithmetic Circuits.

Jinpeng LvPriyank KallaFlorian Enescu
Published in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2013)
Keyphrases
  • formal verification
  • numerically stable
  • galois field
  • model checking
  • polynomial equations
  • bounded model checking
  • automated verification
  • high speed
  • peer to peer
  • efficient computation