29 search results - page 6 / 6 » Extending SAT Solvers to Cryptographic Problems |
125
click to vote
DAC
2007
ACM
16 years 4 months ago
2007
ACM
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
139
Voted
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Programs with irregular patterns of dynamic data structures and/or those with complicated control structures such as recursion are notoriously difficult to parallelize efficient...
124
click to vote
ISSTA
2004
ACM
15 years 8 months ago
2004
ACM
Constraints in predicate or relational logic can be translated into boolean logic and solved with a SAT solver. For faster solving, it is common to exploit the typing of predicate...
127
click to vote
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we introduce an extension of propositional logic that allows clauses to be weighted with values from a generic semiring. The main interest of this extension is that ...