295 search results - page 22 / 59 » SAT, SMT and Applications |
SAT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. During the recent years, the development of tools for deciding Quantified Boolean Formulas (QBFs) has been accompanied by a steady supply of real-world instances, i.e., ...
ICCD
2000
IEEE
15 years 4 months ago
2000
IEEE
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight...
101
click to vote
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
110
click to vote
ICCAD
2002
IEEE
15 years 8 months ago
2002
IEEE
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
JSAC
2006
14 years 11 months ago
2006
We address the problem of secure and fault-tolerant communication in the presence of adversaries across a multihop wireless network with frequently changing topology. To effectivel...