Priyank Kalla

发表

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

Boolean Gröbner Basis Reductions on Finite Field Datapath Circuits Using the Unate Cube Set Algebra

Priyank Kalla, Utkarsh Gupta, Vikas Rao, 2019, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

Crossing-Aware Channel Routing for Integrated Optics

Steve Blair, Priyank Kalla, Christopher Condrat, 2014, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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.

Crossing-aware channel routing for photonic waveguides

Steve Blair, Priyank Kalla, Christopher Condrat, 2013, 2013 IEEE 56th International Midwest Symposium on Circuits and Systems (MWSCAS).

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

Thermal-aware synthesis of integrated photonic ring resonators

Steve Blair, Priyank Kalla, Christopher Condrat, 2014, 2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

Emerging Circuit Technologies: An Overview on the Next Generation of Circuits

Robert Wille, Rolf Drechsler, Priyank Kalla, 2018, Advanced Logic Synthesis.

Taylor Expansion Diagrams: A Canonical Representation for Verification of Data Flow Designs

Priyank Kalla, Maciej J. Ciesielski, Serkan Askar, 2006, IEEE Transactions on Computers.

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

Algebraic techniques to enhance common sub-expression elimination for polynomial system synthesis

Priyank Kalla, Sivaram Gopalakrishnan, P. Kalla, 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

A Methodology for Thermal Characterization Abstraction of Integrated Opto-Electronic Layouts

Steve Blair, Priyank Kalla, Lawrence M. Schlitt, 2016, 2016 29th International Conference on VLSI Design and 2016 15th International Conference on Embedded Systems (VLSID).

BDD-based logic synthesis for LUT-based FPGAs

Russell Tessier, Priyank Kalla, Navin Vemuri, 2002, TODE.

Channel routing for integrated optics

Steve Blair, Priyank Kalla, Christopher Condrat, 2013, 2013 ACM/IEEE International Workshop on System Level Interconnect Prediction (SLIP).

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

A Gröbner Basis Approach to CNF-Formulae Preprocessing

Priyank Kalla, Christopher Condrat, 2007, TACAS.

Strategies for solving the Boolean satisfiability problem using binary decision diagrams

Zhihong Zeng, Priyank Kalla, Maciej J. Ciesielski, 2001, J. Syst. Archit..

LPSAT: a unified approach to RTL satisfiability

Zhihong Zeng, Priyank Kalla, Maciej J. Ciesielski, 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.

Logic synthesis for integrated optics

Steve Blair, Priyank Kalla, Christopher Condrat, 2011, GLSVLSI '11.

Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields

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

A comprehensive approach to the partial scan problem using implicitstate enumeration

Priyank Kalla, Maciej J. Ciesielski, 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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.

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.

Design Automation for On-Chip Nanophotonic Integration

Steve Blair, Priyank Kalla, Christopher Condrat, 2015 .

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.

Scalable formal verification of finite field arithmetic circuits using computer algebra techniques

Priyank Kalla, Jinpeng Lv, P. Kalla, 2012 .

Testability of sequential circuits with multi-cycle false paths

Priyank Kalla, Maciej J. Ciesielski, 1997, Proceedings. 15th IEEE VLSI Test Symposium (Cat. No.97TB100125).

Chairs' welcome message

Priyank Kalla, Prabhat Mishra, 2009, HLDVT.

Sequential Logic Optimization with Implicit Retiming and Resynthesis

Priyank Kalla, Maciej Ciesielski, S. Bommu, 1997 .

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

High-level design verification using Taylor Expansion Diagrams: first results

Priyank Kalla, Emmanuel Boutillon, Eric Martin, 2002, Seventh IEEE International High-Level Design Validation and Test Workshop, 2002..

A BDD-based satisfiability infrastructure using the unate recursive paradigm

Zhihong Zeng, Priyank Kalla, Maciej J. Ciesielski, 2000, DATE '00.

Taylor expansion diagrams: a new representation for RTL verification

Zhihong Zeng, Priyank Kalla, Bruno Rouzeyre, 2001, Sixth IEEE International High-Level Design Validation and Test Workshop.

Formal Verification of Galois Field Multipliers Using Computer Algebra Techniques

Priyank Kalla, Jinpeng Lv, 2012, 2012 25th International Conference on VLSI Design.

CORRECTNESS AND REDUCTION IN TIMED CIRCUIT ANALYSIS

Peter A. Beerel, Chris J. Myers, Ganesh Gopalakrishnan, 2003 .

Optimization of polynomial datapaths using finite ring algebra

Priyank Kalla, Sivaram Gopalakrishnan, P. Kalla, 2007, TODE.

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

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

Variable Ordering for Efficient SAT Search by Analyzing Constraint-Variable Dependencies

Priyank Kalla, Vijay Durairaj, P. Kalla, 2005, SAT.

Guiding CNF-SAT search via efficient constraint partitioning

Priyank Kalla, Vijay Durairaj, 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..

Dynamic analysis of constraint-variable dependencies to guide SAT diagnosis

Priyank Kalla, Vijay Durairaj, P. Kalla, 2004, Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940).

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.

Taylor expansion diagrams: a compact, canonical representation with applications to symbolic verification

Zhihong Zeng, Priyank Kalla, Bruno Rouzeyre, 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

DA vision 2015: From here to eternity

Miodrag Potkonjak, Steven P. Levitan, Priyank Kalla, 2015, 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

A comprehensive approach to the partial scan problem using implicit state enumeration

Priyank Kalla, Maciej J. Ciesielski, 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).

2009 ACM TODAES best paper award: Optimization of polynomial datapaths using finite ring algebra

Priyank Kalla, Sivaram Gopalakrishnan, P. Kalla, 2009, TODE.

Formal verification of arithmetic datapaths using algebraic geometry and symbolic computation

Priyank Kalla, 2015, 2015 Formal Methods in Computer-Aided Design (FMCAD).

Exploiting hypergraph partitioning for efficient Boolean satisfiability

Priyank Kalla, Vijay Durairaj, P. Kalla, 2004, Proceedings. Ninth IEEE International High-Level Design Validation and Test Workshop (IEEE Cat. No.04EX940).

Integrating CNF and BDD based SAT solvers

Priyank Kalla, Sivaram Gopalakrishnan, Vijay Durairaj, 2003, Eighth IEEE International High-Level Design Validation and Test Workshop.

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

Leveraging Groebner bases and SAT for hardware/software verification

Priyank Kalla, 2014 .

Guiding Cnf-sat Search by Analyzing Constraint-variable Dependencies and Clause Lengths

Priyank Kalla, Vijay Durairaj, P. Kalla, 2022 .

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

Performance driven resynthesis by exploiting retiming-induced state register equivalence

Priyank Kalla, Maciej J. Ciesielski, M. Ciesielski, 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

Optimization of Arithmetic Datapaths with Finite Word-Length Operands

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

Verification of arithmetic datapaths using polynomial function models and congruence solving

Priyank Kalla, Sivaram Gopalakrishnan, Namrata Shekhar, 2008, 2008 IEEE/ACM International Conference on Computer-Aided Design.

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

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

Priyank Kalla, Florian Enescu, Utkarsh Gupta, 2018 .

Guiding CNF-SAT search via efficient constraint partitioning

Priyank Kalla, V. Durairaj, 2004, ICCAD 2004.

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

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

An infrastructure for rtl validation and verification

Priyank Kalla, Maciej Ciesielski, 2002 .

Verification of arithmetic datapaths using polynomial function models and congruence solving

Priyank Kalla, Sivaram Gopalakrishnan, Neal Tew, 2008, ICCAD 2008.

VLSI Logic Test , Validation and Verification Lecture 7 Properties & Applications of Binary Decision Diagrams Instructor

Priyank Kalla, .

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 .