77 search results - page 8 / 16 » Testing Basic Boolean Formulae |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Much effort is spent everyday by programmers in trying to reduce long, failing execution traces to the cause of the error. We present a new algorithm for error cause localization ...
JC
2008
13 years 7 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
FATES
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We propose a syntax-driven test generation technique to auly derive abstract test cases from a set of requirements expressed in a linear temporal logic. Assuming that an ...
SAT
2009
Springer
14 years 2 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
ITCC
2002
IEEE
14 years 11 days ago
2002
IEEE
Many job applications on the web [3-4, 7-8, 10, 12] provide only simple boolean comparing using only basic requirement information (i.e., degree, age) for searching and matching j...