Florian Enescu

发表

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).

Efficient Gröbner basis reductions for formal verification of galois field multipliers

Priyank Kalla, Florian Enescu, Jinpeng Lv, 2012, 2012 Design, Automation & Test in Europe Conference & Exhibition (DATE).

Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors

Priyank Kalla, Florian Enescu, Sivaram Gopalakrishnan, 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

Post-Verification Debugging and Rectification of Finite Field Arithmetic Circuits using Computer Algebra Techniques

Priyank Kalla, Florian Enescu, Utkarsh Gupta, 2018, 2018 Formal Methods in Computer Aided Design (FMCAD).

On the Rectifiability of Arithmetic Circuits using Craig Interpolants in Finite Fields

Priyank Kalla, Florian Enescu, Utkarsh Gupta, 2018, 2018 IFIP/IEEE International Conference on Very Large Scale Integration (VLSI-SoC).

Word-level traversal of finite state machines using algebraic geometry

Priyank Kalla, Florian Enescu, Xiaojun Sun, 2016, 2016 IEEE International High Level Design Validation and Test Workshop (HLDVT).

Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields

Priyank Kalla, Florian Enescu, Utkarsh Gupta, 2018, VLSI-SoC.

Simulation Bounds for Equivalence Verification of Polynomial Datapaths Using Finite Ring Algebra

Priyank Kalla, Florian Enescu, M. Brandon Meredith, 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

Computing the invariants of intersection algebras of principal monomial ideals

Florian Enescu, Sandra Spiroff, 2019, Int. J. Algebra Comput..

Equivalence verification of arithmetic datapaths with multiple word-length operands

Priyank Kalla, Florian Enescu, Namrata Shekhar, 2006, Proceedings of the Design Automation & Test in Europe Conference.

Simulation Bounds for Equivalence Verification of Arithmetic Datapaths with Finite Word-Length Operands

Priyank Kalla, Florian Enescu, M. Brandon Meredith, 2006, 2006 Formal Methods in Computer Aided Design.

Verification of composite Galois field multipliers over GF ((2m)n) using computer algebra techniques

Priyank Kalla, Florian Enescu, Jinpeng Lv, 2011, 2011 IEEE International High Level Design Validation and Test Workshop.

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

Priyank Kalla, Florian Enescu, Jinpeng Lv, 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

Exploiting vanishing polynomials for equivalence verification of fixed-size arithmetic datapaths

Priyank Kalla, Florian Enescu, Sivaram Gopalakrishnan, 2005, 2005 International Conference on Computer Design.

Exploring Algebraic Interpolants for Rectification of Finite Field Arithmetic Circuits with Gröbner Bases

Priyank Kalla, Florian Enescu, Utkarsh Gupta, 2019, 2019 IEEE European Test Symposium (ETS).

Equivalence Verification of Polynomial Datapaths Using Ideal Membership Testing

Florian Enescu, Namrata Shekhar, Sudhakar Kalla, 2007, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm

Priyank Kalla, Florian Enescu, Xiaojun Sun, 2016, CP.

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.

Equivalence verification of polynomial datapaths with fixed-size bit-vectors using finite ring algebra

Priyank Kalla, Florian Enescu, Sivaram Gopalakrishnan, 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

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).

Optimization of Arithmetic Datapaths with Finite Word-Length Operands

Priyank Kalla, Florian Enescu, Sivaram Gopalakrishnan, 2007, 2007 Asia and South Pacific Design Automation Conference.

Word-Level Multi-Fix Rectifiability of Finite Field Arithmetic Circuits

Priyank Kalla, Florian Enescu, Vikas Rao, 2021, 2021 22nd International Symposium on Quality Electronic Design (ISQED).

Rectification of Integer Arithmetic Circuits using Computer Algebra Techniques

Priyank Kalla, Florian Enescu, Vikas Rao, 2021, 2021 IEEE 39th International Conference on Computer Design (ICCD).

Algebraic Techniques for Rectification of Finite Field Circuits

Priyank Kalla, Florian Enescu, Vikas Rao, 2021, 2021 IFIP/IEEE 29th International Conference on Very Large Scale Integration (VLSI-SoC).

The generators, relations and type of the Backelin semigroup

Florian Enescu, Arun Suresh, 2021, Communications in Algebra.

Intersection algebras for principal monomial ideals in polynomial rings

Florian Enescu, Sara Malec, S. Malec, 2014, 1409.1319.

Craig Interpolants in Finite Fields using Algebraic Geometry : Theory and Application

Priyank Kalla, Florian Enescu, Utkarsh Gupta, 2018 .

Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors

Priyank Kalla, Florian Enescu, Sivaram Gopalakrishnan, 2007, ICCAD 2007.

The Frobenius structure of local cohomology

Florian Enescu, Melvin Hochster, M. Hochster, 2007, 0708.0553.

Extended Version of a Paper Accepted for Publication in Ieee Trans. on Cad, Accepted March 2013 1 Efficient Gr¨obner Basis Reductions for Formal Verification of Galois Field Arithmetic Circuits

Priyank Kalla, Florian Enescu, P. Kalla, 2013 .