1241 search results - page 75 / 249 » Path-oriented random testing |
129
click to vote
FOSSACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
142
click to vote
DATE
2005
IEEE
15 years 10 months ago
2005
IEEE
Functional verification of microprocessors is one of the most complex and expensive tasks in the current system-on-chip design process. A significant bottleneck in the validatio...
129
Voted
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
126
click to vote
ISSTA
1993
ACM
15 years 8 months ago
1993
ACM
Most of the effort that goes into improving the quality of software paradoxically does not lead to quantitative, measurable quality. Software developers and quality-assurance orga...
124
click to vote
APPROX
2005
Springer
15 years 10 months ago
2005
Springer
A string α ∈ Σn is called p-periodic, if for every i, j ∈ {1, . . . , n}, such that i ≡ j mod p, αi = αj, where αi is the i-th place of α. A string α ∈ Σn is said t...