Sciweavers

99 search results - page 5 / 20
» Analysis of the Linux Random Number Generator
Sort
View
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
11 years 10 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...
ICSE
2010
IEEE-ACM
14 years 10 days ago
Is operator-based mutant selection superior to random mutant selection?
Due to the expensiveness of compiling and executing a large number of mutants, it is usually necessary to select a subset of mutants to substitute the whole set of generated mutan...
Lu Zhang, Shan-Shan Hou, Jun-Jue Hu, Tao Xie, Hong...
ICSE
2008
IEEE-ACM
14 years 8 months ago
ARTOO: adaptive random testing for object-oriented software
Intuition is often not a good guide to know which testing strategies will work best. There is no substitute for experimental analysis based on objective criteria: how many bugs a ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
IH
2005
Springer
14 years 1 months ago
Embedding Covert Channels into TCP/IP
It is commonly believed that steganography within TCP/IP is easily achieved by embedding data in header fields seemingly filled with “random” data, such as the IP identifier...
Steven J. Murdoch, Stephen Lewis
TACAS
2009
Springer
212views Algorithms» more  TACAS 2009»
14 years 2 months ago
Semantic Reduction of Thread Interleavings in Concurrent Programs
Abstract. We propose a static analysis framework for concurrent programs based on reduction of thread interleavings using sound invariants on the top of partial order techniques. S...
Vineet Kahlon, Sriram Sankaranarayanan, Aarti Gupt...