The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
: The application of scientifically derived theories on software testing strongly depends on their ability to provide a value for practice. We provide a comprehensive review on the...
Analysis of IC technology trends indicates that Iddq testing may be approaching its limits of applicability. The new concept of the current signature may expand this limit under t...
This article presents experiences in the automation of a testing process. The main goal is the unified testing of not only one program, but a whole family of programs. The family ...
The incorporation of context-awareness capabilities into pervasive applications allows them to leverage contextual information to provide additional services while maintaining an ...
Zhimin Wang, Sebastian G. Elbaum, David S. Rosenbl...