Sciweavers

1028 search results - page 71 / 103
» Using Attack Graphs to Design Systems
Sort
View
146 views 112 votes 16 years 2 months ago  DAC 2007»
Processing and storage of confidential or critical information is an every day occurrence in computing systems. The trustworthiness of computing devices has become an important co...
308 views 135 votes 14 years 11 months ago  SIGMOD 2010»
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
135 views 101 votes 15 years 7 months ago  CODES 2006»
Embedded system synthesis, multiprocessor synthesis, and thread assignment policy design all require detailed knowledge of the runtime communication patterns among different threa...
130 views 107 votes 15 years 7 months ago  SAFECOMP 2007»
With the rapid progress in science and technology, we find ubiquitous use of safety-critical systems in avionics, consumer electronics, and medical instruments. In such systems, u...
108 views 117 votes 15 years 6 months ago  HT 2005»
We describe Eureka, a file system search engine that takes into account the inherent relationships among files in order to improve the rankings of search results. The key idea b...
130 views 120 votes 15 years 6 months ago  NOMS 2002»
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
104 views 94 votes 15 years 3 months ago  USS 2008»
In light of the systemic vulnerabilities uncovered by recent reviews of deployed e-voting systems, the surest way to secure the voting process would be to scrap the existing syste...
81 views 97 votes 15 years 6 months ago  PCI 2005»
In this paper, we present the rationale and the baseline of a notation which can be used on its own or as an extension to standard UML to facilitate specification of an interactive...
116 views 117 votes 15 years 6 months ago  ISCAS 2003»
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
211 views 155 votes 15 years 6 months ago  ISPA 2004»
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...