613 search results - page 7 / 123 » Finding and Fixing Faults |
LFP
1992
14 years 10 months ago
1992
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
ICST
2009
IEEE
15 years 4 months ago
2009
IEEE
GEGICK, MICHAEL CHARLES. Predicting Attack-prone Components with Source Code Static Analyzers. (Under the direction of Laurie Williams). No single vulnerability detection techniqu...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we revisit a known but ignored weakness of the RC4 keystream generator, where secret state info leaks to the generated keystream, and show that this leakage, also kno...
SIGSOFT
2008
ACM
15 years 10 months ago
2008
ACM
Many testing and analysis techniques have been developed for inhouse use. Although they are effective at discovering defects before a program is deployed, these techniques are oft...
ALGORITHMICA
2010
14 years 9 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...