Sciweavers

94 search results - page 6 / 19
» Weakest-precondition of unstructured programs
Sort
View
CCS
2006
ACM
13 years 11 months ago
Replayer: automatic protocol replay by binary analysis
We address the problem of replaying an application dialog between two hosts. The ability to accurately replay application dialogs is useful in many security-oriented applications,...
James Newsome, David Brumley, Jason Franklin, Dawn...
ASPLOS
2006
ACM
14 years 1 months ago
Temporal search: detecting hidden malware timebombs with virtual machines
Worms, viruses, and other malware can be ticking bombs counting down to a specific time, when they might, for example, delete files or download new instructions from a public we...
Jedidiah R. Crandall, Gary Wassermann, Daniela A. ...
PPNA
2011
12 years 10 months ago
Ad-hoc limited scale-free models for unstructured peer-to-peer networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Durgesh Rani Kumari, Hasan Guclu, Murat Yuksel
ICCL
1998
IEEE
13 years 11 months ago
Breaking Abstractions and Unstructuring Data Structures
Christian S. Collberg, Clark D. Thomborson, Dougla...
INFSOF
2006
73views more  INFSOF 2006»
13 years 7 months ago
Theory and algorithms for slicing unstructured programs
Program slicing identifies parts of a program that potentially affect a chosen computation. It has many applications in software engineering, including maintenance, evolution and ...
Mark Harman, Arun Lakhotia, David Binkley