Sciweavers

85 search results - page 16 / 17
» Mimimorphism: a new approach to binary code obfuscation
Sort
View
RAID
2005
Springer
13 years 11 months ago
Polymorphic Worm Detection Using Structural Information of Executables
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
Christopher Krügel, Engin Kirda, Darren Mutz,...
PLDI
2009
ACM
14 years 1 months ago
Error propagation analysis for file systems
Unchecked errors are especially pernicious in operating system file management code. Transient or permanent hardware failures are inevitable, and error-management bugs at the fi...
Cindy Rubio-González, Haryadi S. Gunawi, Be...
ISSTA
2010
ACM
13 years 10 months ago
Proving memory safety of floating-point computations by combining static and dynamic program analysis
Whitebox fuzzing is a novel form of security testing based on dynamic symbolic execution and constraint solving. Over the last couple of years, whitebox fuzzers have found many ne...
Patrice Godefroid, Johannes Kinder
CCS
2010
ACM
13 years 6 months ago
Input generation via decomposition and re-stitching: finding bugs in Malware
Attackers often take advantage of vulnerabilities in benign software, and the authors of benign software must search their code for bugs in hopes of finding vulnerabilities before...
Juan Caballero, Pongsin Poosankam, Stephen McCaman...
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 6 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur