14 search results - page 1 / 3 » Lower Bound Based DDD Minimization for Efficient Symbolic Ci... |
ICCD
2001
IEEE
14 years 1 months ago
2001
IEEE
FMCAD
2004
Springer
13 years 10 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
EMSOFT
2009
Springer
13 years 8 months ago
2009
Springer
This paper addresses the question of producing modular sequential imperative code from synchronous data-flow networks. Precisely, given a system with several input and output flow...
ICCAD
2009
IEEE
13 years 2 months ago
2009
IEEE
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
DAC
2004
ACM
14 years 5 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...