48 search results - page 3 / 10 » Random Test Run Length and Effectiveness |
198
click to vote
ICST
2008
IEEE
16 years 1 days ago
2008
IEEE
Web applications have rapidly become a critical part of business for many organizations. However, increased usage of web applications has not been reciprocated with corresponding ...
142
Voted
SAT
2005
Springer
15 years 11 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
177
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
150
click to vote
ASPLOS
2010
ACM
16 years 14 days ago
2010
ACM
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
148
Voted
ASPDAC
2004
ACM
15 years 11 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...