Sciweavers

524 search results - page 24 / 105
» Temporal reachability graphs
Sort
View
ACSAC
2009
IEEE
14 years 4 months ago
Modeling Modern Network Attacks and Countermeasures Using Attack Graphs
Abstract—By accurately measuring risk for enterprise networks, attack graphs allow network defenders to understand the most critical threats and select the most effective counter...
Kyle Ingols, Matthew Chu, Richard Lippmann, Seth E...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
14 years 3 months ago
Incremental Deterministic Planning
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
ASPDAC
2005
ACM
99views Hardware» more  ASPDAC 2005»
13 years 11 months ago
Implication of assertion graphs in GSTE
- We address the problem of implication of assertion graphs that occur in generalized symbolic trajectory evaluation (GSTE). GSTE has demonstrated its powerful capacity in formal v...
Guowu Yang, Jin Yang, William N. N. Hung, Xiaoyu S...
ESWS
2009
Springer
13 years 7 months ago
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
Jonas Tappolet, Abraham Bernstein
VLDB
1993
ACM
121views Database» more  VLDB 1993»
14 years 1 months ago
Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
Dimitris Plexousakis