Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields - VLSI-SoC: Design and Engineering of Electronics Systems Based on New Computing Paradigms Access content directly
Conference Papers Year : 2019

Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields

Utkarsh Gupta
  • Function : Author
  • PersonId : 1056409
Irina Ilioaea
  • Function : Author
  • PersonId : 1056410
Vikas Rao
  • Function : Author
  • PersonId : 1056411
Arpitha Srinath
  • Function : Author
  • PersonId : 1056412
Priyank Kalla
  • Function : Author
  • PersonId : 1056413
Florian Enescu
  • Function : Author
  • PersonId : 1056414


When formal verification of arithmetic circuits identifies the presence of a bug in the design, the task of rectification needs to be performed to correct the function implemented by the circuit so that it matches the given specification. In our recent work [26], we addressed the problem of rectification of buggy finite field arithmetic circuits. The problems are formulated by means of a set of polynomials (ideals) and solutions are proposed using concepts from computational algebraic geometry. Single-fix rectification is addressed – i.e. the case where any set of bugs can be rectified at a single net (gate output). We determine if single-fix rectification is possible at a particular net, formulated as the Weak Nullstellensatz test and solved using Gröbner bases. Subsequently, we introduce the concept of Craig interpolants in polynomial algebra over finite fields and show that the rectification function can be computed using algebraic interpolants. This article serves as an extension to our previous work, provides a formal definition of Craig interpolants in finite fields using algebraic geometry and proves their existence. We also describe the computation of interpolants using elimination ideals with Gröbner bases and prove that our procedure computes the smallest interpolant. As the Gröbner basis algorithm exhibits high computational complexity, we further propose an efficient approach to compute interpolants. Experiments are conducted over a variety of finite field arithmetic circuits which demonstrate the superiority of our approach against SAT-based approaches.
Fichier principal
Vignette du fichier
485996_1_En_5_Chapter.pdf (295.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02321766 , version 1 (21-10-2019)





Utkarsh Gupta, Irina Ilioaea, Vikas Rao, Arpitha Srinath, Priyank Kalla, et al.. Rectification of Arithmetic Circuits with Craig Interpolants in Finite Fields. 26th IFIP/IEEE International Conference on Very Large Scale Integration - System on a Chip (VLSI-SoC), Oct 2018, Verona, Italy. pp.79-106, ⟨10.1007/978-3-030-23425-6_5⟩. ⟨hal-02321766⟩
43 View
36 Download



Gmail Facebook X LinkedIn More