PHAETON: A SAT-Based Framework for Timing-Aware Path Sensitization
- 21 July 2015
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 65 (6) , 1869-1881
Abstract
Knowledge about sensitizable paths through combinational logic is essential for numerous design tasks. We present the framework PHAETON which identifies sensitizable paths and generates test pairs to exercise these paths using Boolean satisfiability (SAT). PHAETON supports a large number of models and sensitization conditions and provides a generic interface that can be used by applications. It incorporates a novel application-specific unary representation of integer numbers to integrate timing information with logical conditions within the same monolithic SAT formula. Due to a number of further elaborate speed-up techniques, PHAETON scales to industrial circuits. Experimental results show the performance of PHAETON in classical K longest path generation tasks and in new post-silicon validation and characterization scenarios.Keywords
Funding Information
- DFG (BE 1176-15/2, PO 1220-2/2)
This publication has 28 references indexed in Scilit:
- Efficient SAT-based Dynamic Compaction and Relaxation for Longest Sensitizable Paths2013
- Accurate Computation of Sensitizable Paths Using Answer Set ProgrammingLecture Notes in Computer Science, 2013
- Small-delay-fault ATPG with waveform accuracy2012
- MONSOON: SAT-Based ATPG for Path Delay Faults Using Multiple-Valued LogicsJournal of Electronic Testing, 2010
- Models for Delay Faults2009
- Debug support for complex systems on-chip: a reviewIEE Proceedings - Computers and Digital Techniques, 2006
- False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation2002
- RT-level ITC'99 benchmarks and first ATPG resultsIEEE Design & Test of Computers, 2000
- Unveiling the ISCAS-85 benchmarks: a case study in reverse engineeringIEEE Design & Test of Computers, 1999
- An incremental algorithm for identification of longest (shortest) pathsIntegration, 1994