Sciweavers

201 search results - page 22 / 41
» Using a SAT solver to generate checking sequences
Sort
View
IASTEDSE
2004
13 years 9 months ago
A symbolic Java virtual machine for test case generation
Quality management is becoming a more and more important part of the software development process. As software testing is currently understood as the core function of the quality ...
Roger A. Müller, Christoph Lembeck, Herbert K...
FLAIRS
2008
13 years 8 months ago
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization
Unit propagation-based (UP) lower bounds are used in the vast majority of current Max-SAT solvers. However, lower bounds based on UP have seldom been applied in PseudoBoolean Opti...
Federico Heras, Vasco M. Manquinho, João Ma...
WEBDB
2010
Springer
172views Database» more  WEBDB 2010»
14 years 17 days ago
Find your Advisor: Robust Knowledge Gathering from the Web
We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of int...
Ndapandula Nakashole, Martin Theobald, Gerhard Wei...
IJFCS
2006
110views more  IJFCS 2006»
13 years 7 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 11 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...