Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm. - Xiaojun Sun; Irina Ilioaea; Priyank Kalla; Florian Enescu (CP, 2016)

Post-Verification Debugging and Rectification of Finite Field Arithmetic Circuits using Computer Algebra Techniques. - Vikas Rao; Utkarsh Gupta; Irina Ilioaea; Arpitha Srinath; Priyank Kalla; Florian Enescu (FMCAD, 2018)

On the Rectifiability of Arithmetic Circuits using Craig Interpolants in Finite Fields. - Utkarsh Gupta; Irina Ilioaea; Vikas Rao; Arpitha Srinath; Priyank Kalla; Florian Enescu (VLSI-SoC, 2018)

Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields. - Utkarsh Gupta; Irina Ilioaea; Vikas Rao; Arpitha Srinath; Priyank Kalla; Florian Enescu (VLSI-SoC (Selected Papers), 2018)

Exploring Algebraic Interpolants for Rectification of Finite Field Arithmetic Circuits with Gröbner Bases. - Utkarsh Gupta; Priyank Kalla; Irina Ilioaea; Florian Enescu (ETS, 2019)

Word-Level Multi-Fix Rectifiability of Finite Field Arithmetic Circuits. - Vikas Rao; Irina Ilioaea; Haden Ondricek; Priyank Kalla; Florian Enescu (ISQED, 2021)