2877 search results - page 95 / 576 » The Complexity of Planarity Testing |
134
click to vote
ICSE
2003
IEEE-ACM
15 years 9 months ago
2003
IEEE-ACM
This paper presents a model checking-based approach to data flow testing. We characterize data flow oriented coverage criteria in temporal logic such that the problem of test ge...
129
Voted
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
123
Voted
ICCAD
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper, we present results for significantly improving the performance of sequential circuit diagnostic test pattern generation (DATPG). Our improvements are achieved by de...
126
click to vote
COR
2008
15 years 4 months ago
2008
This paper presents a tabu search metaheuristic algorithm for the automatic generation of structural software tests. It is a novel work since tabu search is applied to the automat...
136
click to vote
GLVLSI
2008
IEEE
15 years 10 months ago
2008
IEEE
Due to the increasing complexity of today’s embedded systems, the analysis and validation of such systems is becoming a major challenge. UML is gradually adopted in the embedded...