We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
Abstract Ajay Chander1 , Drew Dean2 , and John Mitchell3 1 DoCoMo Communications Laboratories USA, San Jose, CA 95110 2 Computer Science Laboratory, SRI International, Menlo Park, ...
Although Web prefetching is regarded as an effective method to improve client access performance, the associated overhead prevents it from being widely deployed. Specifically, a ...
When performing a program evolution task, developers typically spend a significant amount of effort investigating and re-investigating source code. To reduce this effort, we prop...