Sciweavers

422 search results - page 64 / 85
» Multithreaded SAT Solving
Sort
View
CADE
2002
Springer
14 years 10 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
GLVLSI
2008
IEEE
120views VLSI» more  GLVLSI 2008»
14 years 4 months ago
SAT-based equivalence checking of threshold logic designs for nanotechnologies
Novel nano-scale devices have shown promising potential to overcome physical barriers faced by complementary metaloxide semiconductor (CMOS) technology in future circuit design. H...
Yexin Zheng, Michael S. Hsiao, Chao Huang
ICTAI
1997
IEEE
14 years 1 months ago
Prime Implicant Computation Using Satisfiability Algorithms
The computation of prime implicants has several and significant applications in different areas, including Automated Reasoning, Non-Monotonic Reasoning, Electronic Design Automati...
Vasco M. Manquinho, Paulo F. Flores, João P...
COLING
2008
13 years 11 months ago
A Uniform Approach to Analogies, Synonyms, Antonyms, and Associations
Recognizing analogies, synonyms, antonyms, and associations appear to be four distinct tasks, requiring distinct NLP algorithms. In the past, the four tasks have been treated inde...
Peter D. Turney
CHES
2010
Springer
166views Cryptology» more  CHES 2010»
13 years 11 months ago
Algebraic Side-Channel Analysis in the Presence of Errors
Measurement errors make power analysis attacks difficult to mount when only a single power trace is available: the statistical methods that make DPA attacks so successful are not a...
Yossef Oren, Mario Kirschbaum, Thomas Popp, Avisha...