Sciweavers

428 search results - page 53 / 86
» FPGA-Based SAT Solver
Sort
View
CAV
2010
Springer
176views Hardware» more  CAV 2010»
13 years 10 months ago
Lazy Annotation for Program Testing and Verification
Abstract. We describe an interpolant-based approach to test generation and model checking for sequential programs. The method generates Floyd/Hoare style annotations of the program...
Kenneth L. McMillan
FUIN
2008
96views more  FUIN 2008»
13 years 7 months ago
Computational Efficiency of Intermolecular Gene Assembly
In this paper, we investigate the computational efficiency of gene rearrangement operations found in ciliates, a type of unicellular organisms. We show how the so-called guided re...
Tseren-Onolt Ishdorj, Remco Loos, Ion Petre
JETAI
2008
86views more  JETAI 2008»
13 years 7 months ago
Weighting strategy for non-clausal resolution
Abstract. This paper describes a proof search procedure for propositional nonclausal resolution based on a new weighting strategy that utilizes search methods for propositional sat...
Zbigniew Stachniak, Anton Belov
JSAT
2006
68views more  JSAT 2006»
13 years 7 months ago
Locality and Hard SAT-Instances
In this note we construct a family of SAT-instance based on Eulerian graphs which are aimed at being hard for resolution based SAT-solvers. We discuss some experiments made with i...
Klas Markström
DATE
2005
IEEE
176views Hardware» more  DATE 2005»
14 years 1 months ago
Effective Lower Bounding Techniques for Pseudo-Boolean Optimization
Linear Pseudo-Boolean Optimization (PBO) is a widely used modeling framework in Electronic Design Automation (EDA). Due to significant advances in Boolean Satisfiability (SAT), ...
Vasco M. Manquinho, João P. Marques Silva