Abstract | ||
---|---|---|
This paper presents a novel approach to determine the sensitization probability of a non-robustly testable path using probability density functions (PDFs). The proposed approach systematically refines a set of patterns that sensitize the path non-robustly which initial set has been derived with existing methods, and is kept implicitly. Accurate measure of the sensitization probability is obtained fast by avoiding Monte-Carlo. It is shown experimentally that the proposed approach is accurate and much faster than Monte-Carlo, and thus can be used to rank a collection of non-robust paths considering their sensitization characteristics. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1109/ISQED.2013.6523683 | Quality Electronic Design |
Keywords | Field | DocType |
Monte Carlo methods,circuit testing,probability,sensitivity analysis,Monte Carlo method,nonrobustly testable path,probability density functions,sensitization probability,Binary Decision Diagrams (BDDs),Bounded Delay Model,Monte-Carlo,Non-Robust Sensitization,probability density functions (PDFs) | Convolution of probability distributions,Probability mass function,Combinatorics,Monte Carlo method,Random variable,Computer science,Quantile function,Hybrid Monte Carlo,Algorithm,Real-time computing,Probability distribution,Probability density function | Conference |
ISSN | ISBN | Citations |
1948-3287 | 978-1-4673-4951-2 | 1 |
PageRank | References | Authors |
0.38 | 19 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dheepakkumaran Jayaraman | 1 | 7 | 1.54 |
Spyros Tragoudas | 2 | 625 | 88.87 |