610 search results - page 75 / 122 » Using SAT in QBF |
CAV
2012
Springer
11 years 11 months ago
2012
Springer
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
ACL
2012
11 years 11 months ago
2012
This paper studies the problem of sentencelevel semantic coherence by answering SATstyle sentence completion questions. These questions test the ability of algorithms to distingui...
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...
JSAT
2008
13 years 9 months ago
2008
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
CHES
2010
Springer
13 years 10 months ago
2010
Springer
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...