Name
Abstract | ||
|---|---|---|
Unknown values emerge during the design and test generation process as well as during later test application and system operation. They adversely affect the test quality by reducing the controllability and observability of internal circuit structures - resulting in a loss of fault coverage. To handle unknown values, conventional test generation algorithms as used in state-of-the-art commercial tools, rely on n-valued algebras. However, n-valued algebras introduce pessimism as soon as X-values reconverge. Consequently, these algorithms fail to compute the accurate result.This paper focuses on a new highly incremental CEGAR-based algorithm that overcomes these limitations and hence is completely accurate in presence of unknown values. It relies on a modified SAT-solver tailored for this specific problem. The experimental results for circuits with up to 2 400 000 gates show that this combination allows high accuracy and high scalability at the same time. Compared to a state-of-the-art commercial tool, the fault coverage could be increased significantly. Furthermore, the runtime is reduced remarkably compared to a QBF-based encoding of the problem. |
Year | Venue | Keywords |
|---|---|---|
2016 | PROCEEDINGS OF THE 2016 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE) | SAT, CEGAR, test generation, ATPG, unknown values |
Field | DocType | ISSN |
Automatic test pattern generation,Observability,Logic gate,Algorithm design,Fault coverage,Controllability,Computer science,Algorithm,Real-time computing,Encoding (memory),Scalability | Conference | 1530-1591 |
Citations | PageRank | References |
1 | 0.35 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Karsten Scheibler | 1 | 35 | 3.86 |
| Dominik Erb | 2 | 33 | 4.45 |
| Bernd Becker | 3 | 855 | 73.74 |