A formal non-heuristic ATPG approach

This paper presents a formal approach to test combinational circuits. For the sake of explanation we describe the basic algorithms with the help of the stuck-at fault model. Please note that due to the flexibility of our approach, various fault models can be handled. A highly efficient data structure, represented by an implication graph, provides a straightforward evaluation of all relevant local and global implications. The experimental results illustrate impressively the effectiveness of our approach. All the MCNC benchmark circuits are processed without any aborted fault requiring less CPU-time than state-of-the-art tools