|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| B. Becker, A. Czutro, T. Schubert, I. Polian, S. Hillebrecht, "SAT-based Analysis of Sensitisable Paths," IEEE Design & Test of Computers, vol. 99, no. 1, pp. 1, , 5555. | |||
| BibTex | x | ||
| @article{ 10.1109/MDT.2012.2230297, author = {B. Becker and A. Czutro and T. Schubert and I. Polian and S. Hillebrecht}, title = {SAT-based Analysis of Sensitisable Paths}, journal ={IEEE Design & Test of Computers}, volume = {99}, number = {1}, issn = {0740-7475}, year = {5555}, pages = {1}, doi = {http://doi.ieeecomputersociety.org/10.1109/MDT.2012.2230297}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - MGZN JO - IEEE Design & Test of Computers TI - SAT-based Analysis of Sensitisable Paths IS - 1 SN - 0740-7475 SP EP EPD - 1 A1 - B. Becker, A1 - A. Czutro, A1 - T. Schubert, A1 - I. Polian, A1 - S. Hillebrecht, PY - 5555 VL - 99 JA - IEEE Design & Test of Computers ER - | |||
Manufacturing defects in nanoscale tech- nologies have highly complex timing behaviour that is also aected by process variations. While conventional wisdom suggests that it is optimal to detect a delay defect through the longest sensitisable path, non-trivial defect behaviour along with modelling inaccuracies necessitate consideration of paths of well-controlled length during test generation. We present a generic methodology that yields tests through all sensitisable paths of user-specied length. The resulting tests can be employed e.g. within the framework of adaptive testing. The methodology is based on encoding the problem as an instance of the Boolean Satisability Problem (SAT) and thereby leverages recent advances in SAT-solving technology.
Citation:
B. Becker, A. Czutro, T. Schubert, I. Polian, S. Hillebrecht, "SAT-based Analysis of Sensitisable Paths," IEEE Design & Test of Computers, 28 Nov. 2012. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/MDT.2012.2230297>
Usage of this product signifies your acceptance of the Terms of Use.

