Sciweavers

1618 search results - page 102 / 324
» Testing random number generators
Sort
View
SAT
2005
Springer
124views Hardware» more  SAT 2005»
14 years 3 months ago
An Improved Upper Bound for SAT
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...
Evgeny Dantsin, Alexander Wolpert
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
14 years 2 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
ISSRE
2008
IEEE
14 years 4 months ago
Automated Fix Generator for SQL Injection Attacks
A critical problem facing today’s internet community is the increasing number of attacks exploiting flaws found in Web applications. This paper specifically targets input valida...
Fred Dysart, Mark Sherriff
DLOG
2009
13 years 7 months ago
Testing Provers on a Grid - Framework Description
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
Carlos Areces, Daniel Gorín, Alejandra Lore...
ISSTA
2004
ACM
14 years 3 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...