Equivalence Checking of Circuits with Parameterized Specifications

  • Eugene Goldberg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3569)


We consider the problem of equivalence checking of circuits N 1,N 2 with a common specification (CS). We show that circuits N 1 and N 2 have a CS iff they can be partitioned into toggle equivalent subcircuits that are connected “in the same way”. Based on this result, we formulate a procedure for checking equivalence of circuits N 1 and N 2 with specifications S 1 and S 2. This procedure not only checks equivalence of N 1 and N 2 but also verifies that S 1 and S 2 are identical. The complexity of this procedure is linear in specification size and exponential in the value of a specification parameter. Previously we considered specifications parameterized by the size of the largest subcircuit (specification granularity). In this paper we give a more general parameterization based on specification “width”.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alekhnovich, A., Razborov, A.: Satisfiability, Branch-width and Tseitin Tautologies. In: FOCS 2002, pp. 593–603 (2002)Google Scholar
  2. 2.
    Berman, C.L.: Circuit width, Register Allocation and Ordered Binary Decision Diagrams. IEEE Trans. CAD 10(8), 1059–1066 (1991)Google Scholar
  3. 3.
    Broering, E.A., Lokam, S.V.: Width-Based Algorithms for Satisfiability. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 162–171. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  4. 4.
    Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)Google Scholar
  5. 5.
    Goldberg, E., Novikov, Y.: How good can a resolution based SAT-solver be? In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 37–52. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Goldberg, E.: On equivalence checking and logic synthesis of circuits with a common specification. Cadence Berkeley Labs, Technical report, CDNL-TR-2004-1220 (August 2004),
  7. 7.
    Prasad, M.R., Chong, P., Keutzer, K.: Why is Combinatorial ATPG Efficiently Solvable for Practical VLSI Circuits? Journal of Electronic Testing: Theory and Applications 17, 509–527 (2001)CrossRefGoogle Scholar
  8. 8.
    Szeider, S.: On Fixed-parameter Tractable Parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 188–202. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Eugene Goldberg
    • 1
  1. 1.Cadence Berkeley LabsUSA

Personalised recommendations