Sciweavers

73 search results - page 5 / 15
» Finding bugs with a constraint solver
Sort
View
77
Voted
IJCAI
2007
14 years 11 months ago
Learning Implied Global Constraints
Finding a constraint network that will be efficiently solved by a constraint solver requires a strong expertise in Constraint Programming. Hence, there is an increasing interest i...
Christian Bessière, Remi Coletta, Thierry P...
SAT
2005
Springer
129views Hardware» more  SAT 2005»
15 years 2 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
ISSTA
2009
ACM
15 years 4 months ago
Precise pointer reasoning for dynamic test generation
Dynamic test generation consists of executing a program while gathering symbolic constraints on inputs from predicates encountered in branch statements, and of using a constraint ...
Bassem Elkarablieh, Patrice Godefroid, Michael Y. ...
ISCIS
2009
Springer
15 years 4 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
HM
2010
Springer
133views Optimization» more  HM 2010»
14 years 10 months ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...