8094 search results - page 345 / 1619 » Improvements in Formula Generalization |
144
click to vote
DAC
2007
ACM
16 years 7 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
155
click to vote
DAC
2001
ACM
16 years 7 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
152
Voted
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Early power analysis for systems-on-chip (SoC) is crucial for determining the appropriate packaging and cost. This early analysis commonly relies on evaluating power formulas for ...
139
Voted
DAC
2003
ACM
16 years 7 months ago
2003
ACM
Noise affects circuit operation by increasing gate delays and causing latches to capture incorrect values. This paper proposes a method of characterizing correlation of signal tra...
146
click to vote
DAC
2003
ACM
16 years 7 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...