198 search results - page 17 / 40 » Reachability on prefix-recognizable graphs |
CONCUR
2000
Springer
14 years 1 months ago
2000
Springer
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
ACSAC
2005
IEEE
14 years 3 months ago
2005
IEEE
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
ACSAC
2009
IEEE
14 years 4 months ago
2009
IEEE
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...
SYNASC
2006
IEEE
14 years 3 months ago
2006
IEEE
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...
ASPDAC
2005
ACM
13 years 11 months ago
2005
ACM
- 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...