Sciweavers

1618 search results - page 33 / 324
» Testing random number generators
Sort
View
ACSAC
2006
IEEE
14 years 4 months ago
Known/Chosen Key Attacks against Software Instruction Set Randomization
Instruction Set Randomization (ISR) has been proposed as a form of defense against binary code injection into an executing program. One proof-of-concept implementation is Randomiz...
Yoav Weiss, Elena Gabriela Barrantes
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
13 years 9 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
IFIP
2001
Springer
14 years 2 months ago
Random Adjacent Sequences: An Efficient Solution for Logic BIST
: High defect coverage requires good coverage of different fault types. In this paper, we present a comprehensive test vector generation technique for BIST, called Random Single In...
René David, Patrick Girard, Christian Landr...
ISCIS
2003
Springer
14 years 3 months ago
Test Case Generation According to the Binary Search Strategy
One of the important tasks during software testing is the generation of test cases. Unfortunately, existing approaches to test case generation often have problems limiting their us...
Sami Beydeda, Volker Gruhn
TAP
2010
Springer
134views Hardware» more  TAP 2010»
13 years 7 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney