SAT-based Automatic Test Pattern Generation

Authors Rolf Drechsler, Stephan Eggersglüß, Görschwin Fey, Daniel Tille

Thumbnail PDF


  • Filesize: 80 kB
  • 2 pages

Document Identifiers

Author Details

Rolf Drechsler
Stephan Eggersglüß
Görschwin Fey
Daniel Tille

Cite AsGet BibTex

Rolf Drechsler, Stephan Eggersglüß, Görschwin Fey, and Daniel Tille. SAT-based Automatic Test Pattern Generation. In Evolutionary Test Generation. Dagstuhl Seminar Proceedings, Volume 8351, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Due to the rapidly growing size of integrated circuits, there is a need for new algorithms for Automatic Test Pattern Generation (ATPG). While classical algorithms reach their limit, there have been recent advances in algorithms to solve Boolean Satisfiability (SAT). Because Boolean SAT solvers are working on Conjunctive Normal Forms (CNF), the problem has to be transformed. During transformation, relevant information about the problem might get lost and therefore is not available in the solving process. In the following we briefly motivate the problem and provide the latest developments in the field. The technique was implemented and experimental results are presented. The approach was combined with the ATPG framework of NXP Semiconductors. Significant improvements in overall performance and robustness are demonstrated.
  • Circuit
  • ATPG
  • SAT
  • Boolean Satisfiability


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads