10608 search results - page 1712 / 2122 » Complexity of O'Hara's Algorithm |
ICCAD
2007
IEEE
15 years 10 months ago
2007
IEEE
Modern IC designs have reached unparalleled levels of complexity, resulting in more and more bugs discovered after design tape-out However, so far only very few EDA tools for post...
ICCAD
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract—Manufacturing process variations lead to circuit timing variability and a corresponding timing yield loss. Traditional corner analysis consists of checking all process c...
ICCAD
2005
IEEE
15 years 10 months ago
2005
IEEE
State-equivalence based reduction techniques, e.g. bisimulation minimization, can be used to reduce a state transition system to facilitate subsequent verification tasks. However...
ICCAD
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
120
Voted
TLDI
2010
ACM
15 years 10 months ago
2010
ACM
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...