Abstract
This paper presents a novel method for false path detection using satisfiability. It is based on circuit node properties that are related to non-testable stuck-at faults as well as to false path detection. When compared to traditional satisfiability methods that generate sat instances associated to paths, the proposed method is more efficient. This efficiency derives from the fact that most digital circuits have a number of nodes that is smaller than the number of paths.
Original language | English (US) |
---|---|
Pages | 308-311 |
Number of pages | 4 |
DOIs | |
State | Published - 2005 |
Event | 2005 ACM Great Lakessymposium on VLSI, GLSVLSI'05 - Chicago, IL, United States Duration: Apr 17 2005 → Apr 19 2005 |
Other
Other | 2005 ACM Great Lakessymposium on VLSI, GLSVLSI'05 |
---|---|
Country/Territory | United States |
City | Chicago, IL |
Period | 4/17/05 → 4/19/05 |
Keywords
- False Paths
- Satisfiability
- Unateness