2218 search results - page 1 / 444 » Testing Expressibility Is Hard |
CP
2010
Springer
13 years 5 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
IWPSE
2007
IEEE
14 years 1 months ago
2007
IEEE
The starting point for software evolution is usually a change request, expressing the new or updated requirements on the delivered system. The requirements specified in a change ...
CHI
2010
ACM
13 years 4 months ago
2010
ACM
Mobile services can provide users with information relevant to their current circumstances. Distant services in turn can acquire local information from people in an area of intere...
17
Voted
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We study the problem of finding the minimum size DNF formula for a function f : {0, 1}d → {0, 1} given its truth table. We show that unless NP ⊆ DTIME(npoly(log n) ), there i...
ICSM
2006
IEEE
14 years 28 days ago
2006
IEEE
The test case execution order affects the time at which the objectives of testing are met. If the objective is fault detection, an inappropriate execution order might reveal most ...