846 search results - page 125 / 170 » Rewrite-Based Decision Procedures |
153
click to vote
VLSID
2007
IEEE
16 years 6 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
166
click to vote
VLSID
2007
IEEE
16 years 6 months ago
2007
IEEE
Recent advances in microfluidics technology have led to the emergence of miniaturized biochip devices for biochemical analysis. A promising category of microfluidic biochips relie...
171
click to vote
VLSID
2002
IEEE
16 years 6 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
151
click to vote
HPCA
2006
IEEE
16 years 6 months ago
2006
IEEE
Processor architects have a challenging task of evaluating a large design space consisting of several interacting parameters and optimizations. In order to assist architects in ma...
204
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...