• DocumentCode
    2981874
  • Title

    Tautology checking using cross-controllability and cross-observability relations

  • Author

    Cerny, E. ; Mauras, C.

  • Author_Institution
    Dept. d´´Inf. et de Recherche Oper., Montreal Univ., Que., Canada
  • fYear
    1990
  • fDate
    11-15 Nov. 1990
  • Firstpage
    34
  • Lastpage
    37
  • Abstract
    A novel method is described for verifying the equivalence between a combinational circuit and its specification, when both are given in a modular (e.g., factored) form. It is based on the notion of cross-controllability and cross-observability relations that exist between the internal logic values across a cut of the joint composition of the circuit and the specification. It is proven that even after abstracting input and other internal variables the relations are sufficient to verify the equivalence. The abstraction allows reduction of the size of the relation, thus permitting the verification of much larger circuits. A report is presented on the verification of an 8*8 parallel multiplier using at most 527 BDD (binary decision diagram) cells of 21 variables. Extensions to sequential circuits are also discussed.<>
  • Keywords
    combinatorial circuits; controllability; logic design; logic testing; observability; abstraction; binary decision diagram; combinational circuit; cross-controllability; cross-observability relations; equivalence verification; parallel multiplier; tautology checking; Acceleration; Binary decision diagrams; Boolean functions; Circuit testing; Combinational circuits; Context modeling; Data structures; Integrated circuit interconnections; Logic circuits; Sequential circuits;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer-Aided Design, 1990. ICCAD-90. Digest of Technical Papers., 1990 IEEE International Conference on
  • Conference_Location
    Santa Clara, CA, USA
  • Print_ISBN
    0-8186-2055-2
  • Type

    conf

  • DOI
    10.1109/ICCAD.1990.129833
  • Filename
    129833