Sciweavers

2304 search results - page 51 / 461
» On the Vulnerability of Large Graphs
Sort
View
DEDS
2002
106views more  DEDS 2002»
14 years 11 months ago
Efficient Computation and Representation of Large Reachability Sets for Composed Automata
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
Peter Buchholz, Peter Kemper
DAC
2004
ACM
15 years 5 months ago
Hierarchical approach to exact symbolic analysis of large analog circuits
—This paper proposes a novel approach to the exact symbolic analysis of very large analog circuits. The new method is based on determinant decision diagrams (DDDs) representing s...
Sheldon X.-D. Tan, Weikun Guo, Zhenyu Qi
TON
2008
86views more  TON 2008»
14 years 11 months ago
Securing user-controlled routing infrastructures
Designing infrastructures that give untrusted third parties (such as end-hosts) control over routing is a promising research direction for achieving flexible and efficient communic...
Karthik Lakshminarayanan, Daniel Adkins, Adrian Pe...
USS
2010
14 years 9 months ago
Cling: A Memory Allocator to Mitigate Dangling Pointers
Use-after-free vulnerabilities exploiting so-called dangling pointers to deallocated objects are just as dangerous as buffer overflows: they may enable arbitrary code execution. U...
Periklis Akritidis
ESEM
2010
ACM
14 years 10 months ago
Strengthening the empirical analysis of the relationship between Linus' Law and software security
Open source software is often considered to be secure because large developer communities can be leveraged to find and fix security vulnerabilities. Eric Raymond states Linus’ L...
Andrew Meneely, Laurie A. Williams