Reachability analysis and the recently proposed reverse reachability analysis are two important verification techniques f o r communicating finite state machines (CFSMs). The issue of the relative eficiency of reachability analysis and reverse reachability analysis is still unsettled. In this paper we f irst propose a new theory of reachability and reverse reachability analysis. Based on the ne...

Quantifying and verifying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenance, and design. Although attempts to model network reachability have been made, feasible solutions to computing network reachability have remained unknown. In this paper, we propose a suite of algorithms for quantifying ...

Enforcing correct reachability is crucial for an enterprise network to achieve access control, privacy, security and so on. Many sophisticated mechanisms such as router ACLs and firewalls have been developed to enforce the desired reachability. In addition, many other factors such as network dynamics can also impact the network reachability. Thus it is challenging to configure the reachability ...

Quantifying and verifying network reachability is important for security monitoring and auditing as well as many aspects of network management such as troubleshooting, maintenance, and design. Although attempts to model network reachability have been made, feasible solutions to computing network reachability have remained unknown. In this paper, we propose a suite of algorithms for quantifying ...

We study the problem of answering k-hop reachability queries in a directed graph, i.e., whether there exists a directed path of length k, from a source query vertex to a target query vertex in the input graph. The problem of k-hop reachability is a general problem of the classic reachability (where k = ∞). Existing indexes for processing classic reachability queries, as well as for processing s...

We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap node is annotated with a set of reachability states that abstract the reachability of objects represented by the node. The analysis also includes a global pruning step which analyzes a reachability graph to prune imprecise reachability states that c...

This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and deadlock check times for concurrent Ada programs. In general, reachability analysis is intractable, so it is important to be able to predict whether or not this analysis technique is feasible given a specific program to...