Applications of Boolean Satisfiability to Verification and Testing of Switch-Level Circuits

  • Authors:
  • M. Favalli;M. Dalpasso

  • Affiliations:
  • ENDIF - University of Ferrara, Ferrara, Italy 44122;DEI - University of Padova, Padova, Italy 35131

  • Venue:
  • Journal of Electronic Testing: Theory and Applications
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work extends to the switch level the verification and testing techniques based upon boolean satisfiability (SAT), so that SAT-based methodologies can be applied to circuits that cannot be well described at the gate level. The main achieved goal was to define a boolean model describing switch-level circuit operations as a SAT problem instance, to be applied to combinational equivalence checking and bridging-fault test generation. Results are provided for a set of combinational CMOS circuits, showing the feasibility of SAT-based verification and testing of switch-level circuits.