Sciweavers

2304 search results - page 11 / 461
» On the Vulnerability of Large Graphs
Sort
View
SP
1998
IEEE
173views Security Privacy» more  SP 1998»
14 years 1 months ago
An Automated Approach for Identifying Potential Vulnerabilities in Software
This paper presents results from analyzing the vulnerability of security-critical software applications to malicious threats and anomalous events using an automated fault injectio...
Anup K. Ghosh, Tom O'Connor, Gary McGraw
NDSS
2007
IEEE
14 years 3 months ago
RICH: Automatically Protecting Against Integer-Based Vulnerabilities
We present the design and implementation of RICH (Run-time Integer CHecking), a tool for efficiently detecting integer-based attacks against C programs at run time. C integer bug...
David Brumley, Dawn Xiaodong Song, Tzi-cker Chiueh...
CPC
2004
92views more  CPC 2004»
13 years 8 months ago
Large Topological Cliques in Graphs Without a 4-Cycle
Mader asked whether every C4-free graph G contains a subdivision of a complete graph whose order is at least linear in the average degree of G. We show that there is a subdivision...
Daniela Kühn, Deryk Osthus
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
14 years 10 months ago
TALE: A Tool for Approximate Large Graph Matching
Abstract-- Large graph datasets are common in many emerging database applications, and most notably in large-scale scientific applications. To fully exploit the wealth of informati...
Yuanyuan Tian, Jignesh M. Patel
PVLDB
2010
200views more  PVLDB 2010»
13 years 7 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin