Sciweavers

2304 search results - page 110 / 461
» On the Vulnerability of Large Graphs
Sort
View
SICHERHEIT
2010
15 years 4 months ago
Quantifying the Attack Surface of a Web Application
Abstract: The attack surface of a system represents the exposure of application objects to attackers and is affected primarily by architecture and design decisions. Given otherwise...
Thomas Heumann, Sven Türpe, Jörg Keller
USS
2010
15 years 4 months ago
Searching the Searchers with SearchAudit
Search engines not only assist normal users, but also provide information that hackers and other malicious entities can exploit in their nefarious activities. With carefully craft...
John P. John, Fang Yu, Yinglian Xie, Martín...
CSFW
2012
IEEE
13 years 8 months ago
Discovering Concrete Attacks on Website Authorization by Formal Analysis
—Social sign-on and social sharing are becoming an ever more popular feature of web applications. This success is largely due to the APIs and support offered by prominent social ...
Chetan Bansal, Karthikeyan Bhargavan, Sergio Maffe...
LCTRTS
2007
Springer
16 years 7 days ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
ASPDAC
2007
ACM
152views Hardware» more  ASPDAC 2007»
15 years 10 months ago
A Graph Reduction Approach to Symbolic Circuit Analysis
A new graph reduction approach to symbolic circuit analysis is developed in this paper. A Binary Decision Diagram (BDD) mechanism is formulated, together with a specially designed ...
Guoyong Shi, Weiwei Chen, C.-J. Richard Shi