Results 1 - 10 of 2,390

Interprocedural dataflow analysis via graph reachability

by Thomas Reps, Susan Horwitz, Mooly Sagiv , 1994
"... The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in poly-nomial time by transforming them into a special kind of graph-reachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow fun ..."
Abstract - Cited by 454 (34 self) - Add to MetaCart
The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in poly-nomial time by transforming them into a special kind of graph-reachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow

The algorithmic analysis of hybrid systems

by R. Alur, C. Courcoubetis, N. Halbwachs , T. A. Henzinger, P.-H. Ho, X. Nicollin , A. Olivero , J. Sifakis , S. Yovine - THEORETICAL COMPUTER SCIENCE , 1995
"... We present a general framework for the formal specification and algorithmic analysis of hybrid systems. A hybrid system consists of a discrete program with an analog environment. We model hybrid systems as nite automata equipped with variables that evolve continuously with time according to dynamica ..."
Abstract - Cited by 778 (71 self) - Add to MetaCart
to linear hybrid systems. In particular, we consider symbolic model-checking and minimization procedures that are based on the reachability analysis of an infinite state space. The procedures iteratively compute state sets that are definable as unions of convex polyhedra in multidimensional real space. We

Reachability Analysis of Pushdown Automata: Application to Model-Checking

by Ahmed Bouajjani, Javier Esparza, Oded Maler , 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finite-state automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract - Cited by 376 (38 self) - Add to MetaCart
We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finite-state automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like

Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

by Rajeev Alur, Costas Courcoubetis, Thomas A. Henzinger, Pei-Hsin Ho , 1992
"... We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many of the examp ..."
Abstract - Cited by 460 (20 self) - Add to MetaCart
We introduce the framework of hybrid automata as a model and specification language for hybrid systems. Hybrid automata can be viewed as a generalization of timed automata, in which the behavior of variables is governed in each state by a set of differential equations. We show that many

Stable Internet Routing Without Global Coordination

by Lixin Gao - IEEE/ACM Transactions on Networking , 2000
"... The Border Gateway Protocol (BGP) allows an autonomous system (AS) to apply diverse local policies for selecting routes and propagating reachability information to other domains. However, BGP permits ASes to have conflicting policies that can lead to routing instability. This paper proposes a set of ..."
Abstract - Cited by 343 (44 self) - Add to MetaCart
The Border Gateway Protocol (BGP) allows an autonomous system (AS) to apply diverse local policies for selecting routes and propagating reachability information to other domains. However, BGP permits ASes to have conflicting policies that can lead to routing instability. This paper proposes a set

Crawling the Hidden Web

by Sriram Raghavan, Hector Garcia-molina - In VLDB , 2001
"... Current-day crawlers retrieve content only from the publicly indexable Web, i.e., the set of web pages reachable purely by following hypertext links, ignoring search forms and pages that require authorization or prior registration. ..."
Abstract - Cited by 279 (2 self) - Add to MetaCart
Current-day crawlers retrieve content only from the publicly indexable Web, i.e., the set of web pages reachable purely by following hypertext links, ignoring search forms and pages that require authorization or prior registration.

Deriving Traffic Demands for Operational IP networks: Methodology and Experience

by Anja Feldmann, Albert Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford, Fred True - IEEE/ACM TRANSACTIONS ON NETWORKING , 2001
"... Engineering a large IP backbone network without an accurate, network-wide view of the traffic demands is challenging. Shifts in user behavior, changes in routing policies, and failures of network elements can result in significant (and sudden) fluctuations in load. In this paper, we present a model ..."
Abstract - Cited by 297 (39 self) - Add to MetaCart
of traffic demands to support traffic engineering and performance debugging of large Internet Service Provider networks. By de ning a traffic demand as a volume of load originating from an ingress link and destined to a set of egress links, we can capture and predict how routing affects the traffic traveling

Size-estimation framework with applications to transitive closure and reachability

by Edith Cohen - Journal of Computer and System Sciences , 1997
"... Computing the transitive closure in directed graphs is a fundamental graph problem. We consider the more restricted problem of computing the number of nodes reachable from every node and the size of the transitive closure. The fastest known transitive closure algorithms run in O(min{mn, n2.38}) time ..."
Abstract - Cited by 157 (21 self) - Add to MetaCart
.38}) time, where n is the number of nodes and m the number of edges in the graph. We present an O(m) time randomized (Monte Carlo) algorithm that estimates, with small relative error, the sizes of all reachability sets and the transitive closure. Another ramification of our estimation scheme is a Õ(m) time

SARSOP: Efficient Point-Based POMDP Planning by Approximating Optimally Reachable Belief Spaces

by Hanna Kurniawati, David Hsu, Wee Sun Lee
"... Abstract — Motion planning in uncertain and dynamic environments is an essential capability for autonomous robots. Partially observable Markov decision processes (POMDPs) provide a principled mathematical framework for solving such problems, but they are often avoided in robotics due to high computa ..."
Abstract - Cited by 191 (16 self) - Add to MetaCart
computational complexity. Our goal is to create practical POMDP algorithms and software for common robotic tasks. To this end, we have developed a new point-based POMDP algorithm that exploits the notion of optimally reachable belief spaces to improve computational efficiency. In simulation, we successfully

Computation of an overapproximation of the backward reachable set using subsystem level set functions

by Dusan M. Stipanović, Inseok Hwang, Claire J. Tomlin - DYNAMICS OF CONTINUOUS, DISCRETE & IMPULSIVE SYSTEMS SERIES A: MATHEMATICAL ANALYSIS , 2004
"... In this paper, we present a method to decompose the problem of computing the backward reachable set for a dynamic system in a space of a given dimension, into a set of computational problems involving level set functions, each defined in a lower dimensional (subsystem) space. This allows the potent ..."
Abstract - Cited by 18 (3 self) - Add to MetaCart
In this paper, we present a method to decompose the problem of computing the backward reachable set for a dynamic system in a space of a given dimension, into a set of computational problems involving level set functions, each defined in a lower dimensional (subsystem) space. This allows
Results 1 - 10 of 2,390