Sciweavers

301 search results - page 1 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
DAC
2010
ACM
15 years 9 months ago
An efficient algorithm to verify generalized false paths
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
Olivier Coudert
ASPDAC
2006
ACM
125views Hardware» more  ASPDAC 2006»
15 years 9 months ago
Efficient identification of multi-cycle false path
Due to false paths and multi-cycle paths in a circuit, using only topological delay to determine the clock period could be too conservative. In this paper, we address the timing a...
Kai Yang, Kwang-Ting Cheng
127
Voted
DAC
2002
ACM
16 years 6 months ago
False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...
Jing-Jia Liou, Angela Krstic, Li-C. Wang, Kwang-Ti...
ICCAD
1994
IEEE
82views Hardware» more  ICCAD 1994»
15 years 9 months ago
A timing analysis algorithm for circuits with level-sensitive latches
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
Jin-fuw Lee, Donald T. Tang, C. K. Wong
138
Voted
SPAA
2005
ACM
15 years 10 months ago
Efficient algorithms for verifying memory consistency
One approach in verifying the correctness of a multiprocessor system is to show that its execution results comply with the memory consistency model it is meant to implement. It ha...
Chaiyasit Manovit, Sudheendra Hangal