Tim Pruss

发表

Equivalence verification of large Galois field arithmetic circuits using word-level abstraction via Gröbner bases

Tim Pruss, Priyank Kalla, Florian Enescu, 2014, 2014 51st ACM/EDAC/IEEE Design Automation Conference (DAC).

Word-level abstraction from combinational circuits using algebraic geometry

Tim Pruss, 2015 .

Efficient Symbolic Computation for Word-Level Abstraction From Combinational Circuits for Verification Over Finite Fields

Tim Pruss, Priyank Kalla, Florian Enescu, 2016, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

Formal verification of sequential Galois field arithmetic circuits using algebraic geometry

Tim Pruss, Priyank Kalla, Florian Enescu, 2015, 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE).