Sciweavers

483 search results - page 56 / 97
» Linear Ranking with Reachability
Sort
View
ACSAC
2006
IEEE
14 years 4 months ago
Practical Attack Graph Generation for Network Defense
Attack graphs are a valuable tool to network defenders, illustrating paths an attacker can use to gain access to a targeted network. Defenders can then focus their efforts on patc...
Kyle Ingols, Richard Lippmann, Keith Piwowarski
EUROPAR
2004
Springer
14 years 3 months ago
Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...
Bruno Carton, Valentin Mesaros
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
14 years 3 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li
CONCUR
1999
Springer
14 years 2 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea
BIRTHDAY
1994
Springer
14 years 2 months ago
Generalizing Cook's Transformation to Imperative Stack Programs
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
Nils Andersen, Neil D. Jones