FILL and FUNI
- 1 July 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 5 (3) , 631-657
- https://doi.org/10.1145/348019.348311
Abstract
In this paper, we first present an algorithm (FILL) to efficiently identify a large subset of illegal states in synchronous sequential circuits, without assuming a global reset mechanism. A second algorithm, FUNI, finds sequentially untestable faults whose detection requires some of the illegal states computed by FILL. Although based on binary decision diagrams (BDDs), FILL is able to process large circuits by using a new functional partitioning procedure. The incremental building of the set of illegal states guarantees that FILL will always obtain at least a partial solution. FUNI is a direct method that identifies untestable faults without using the exhaustive search involved in automatic test generation (ATG). Experimental results show that FUNI finds a large number of untestable faults up to several orders of magnitude faster than an ATG algorithm that targeted the faults identified by FUNI. Also, many untestable faults identified by FUNI were aborted by the test generator.Keywords
This publication has 21 references indexed in Scilit:
- Combinational profiles of sequential benchmark circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Combinational ATPG theorems for identifying untestable faults in sequential circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Identifying sequential redundancies without searchPublished by Association for Computing Machinery (ACM) ,1996
- Combinational ATPG theorems for identifying untestable faults in sequential circuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- A transitive closure algorithm for test generationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Redundancy identification/removal and test generation for sequential circuits using implicit state enumerationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Synchronizing sequences and symbolic traversal techniques in test generationJournal of Electronic Testing, 1993
- Algorithms for approximate FSM traversalPublished by Association for Computing Machinery (ACM) ,1993
- Classification of faults in synchronous sequential circuitsIEEE Transactions on Computers, 1993
- The multiple observation time test strategyIEEE Transactions on Computers, 1992