Results 1  10
of
2,022
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate 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 finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like
Highdensity reachability analysis
 In ICCAD
, 1995
"... We address the problem of reachability analysis for large nite state systems. Symbolic techniques have revolutionized reachability analysis but still have limitations in traversing large systems. We present techniques to improve the symbolic breadthrst traversal and compute a lower bound on the r ..."
Abstract

Cited by 66 (7 self)
 Add to MetaCart
We address the problem of reachability analysis for large nite state systems. Symbolic techniques have revolutionized reachability analysis but still have limitations in traversing large systems. We present techniques to improve the symbolic breadthrst traversal and compute a lower bound
Techniques for distributed reachability analysis . . .
, 2009
"... In this work we propose techniques for efficient reachability analysis of the state space (e.g., detection of bad states) using a combination of partial order and symmetry based reductions in a distributed setting. The proposed techniques are focused towards explicit state space enumeration based mo ..."
Abstract
 Add to MetaCart
In this work we propose techniques for efficient reachability analysis of the state space (e.g., detection of bad states) using a combination of partial order and symmetry based reductions in a distributed setting. The proposed techniques are focused towards explicit state space enumeration based
Reachability Analysis via Face Lifting
, 1998
"... . In this paper we discuss the problem of calculating the reachable states of a dynamical system defined by ordinary differential equations or inclusions. We present a prototype system for approximating this set and demonstrate some experimental results. 1 Introduction One of the main activities in ..."
Abstract

Cited by 91 (10 self)
 Add to MetaCart
in verifying a discrete system consists in finding the set of system states which are reachable, via the transition relation, from a given initial set of states (control synthesis for discreteevent systems [RW89] can ultimately be reduced to some variant of reachability analysis [AMP95b]). For small finite
Reachability Analysis Using Polygonal Projections
 IN HYBRID SYSTEMS: COMPUTATION AND CONTROL
, 1999
"... Coho is a reachability analysis tool for systems modeled by nonlinear, ordinary differential equations. Coho represents highdimensional objects using projections onto planes corresponding to pairs of variables. This representation is compact and allows efficient algorithms from computational geome ..."
Abstract

Cited by 57 (5 self)
 Add to MetaCart
Coho is a reachability analysis tool for systems modeled by nonlinear, ordinary differential equations. Coho represents highdimensional objects using projections onto planes corresponding to pairs of variables. This representation is compact and allows efficient algorithms from computational
Reachability Analysis for Annotated Code
, 2007
"... Wellspecified programs enable code reuse and therefore techniques that help programmers to annotate code correctly are valuable. We devised an automated analysis that detects unreachable code in the presence of code annotations. We implemented it as an enhancement of the extended static checker ESC ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
Wellspecified programs enable code reuse and therefore techniques that help programmers to annotate code correctly are valuable. We devised an automated analysis that detects unreachable code in the presence of code annotations. We implemented it as an enhancement of the extended static checker
Reachability Analysis of Innermost Rewriting
, 2013
"... Approximating the set of terms reachable by rewriting finds more and more applications ranging from termination proofs of term rewriting systems, cryptographic protocol verification to static analysis of programs. For such applications, the precision of the approximation is crucial. However, such ap ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Approximating the set of terms reachable by rewriting finds more and more applications ranging from termination proofs of term rewriting systems, cryptographic protocol verification to static analysis of programs. For such applications, the precision of the approximation is crucial. However
Controlling State Explosion in Reachability Analysis
, 1993
"... : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : x 1. INTRODUCTION : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 2. BACKGROUND : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1 Dynamic Analysis of Concurrent Systems : : : : : : : : : : : : ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
: : : : : : : : : : : : : : : : 5 2.2 Static Analysis. : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 5 2.2.1 Theorem Proving : : : : : : : : : : : : : : : : : : : : : : : : : 6 2.2.2 Reachability Analysis : : : : : : : : : : : : : : : : : : : : : : : 7 2.2.3 Model Checking
Inner Approximated Reachability Analysis
"... Computing a tight inner approximation of the range of a function over some set is notoriously difficult, way beyond obtaining outer approximations. We propose here a new method to compute a tight inner approximation of the set of reachable states of nonlinear dynamical systems on a bounded time int ..."
Abstract
 Add to MetaCart
Computing a tight inner approximation of the range of a function over some set is notoriously difficult, way beyond obtaining outer approximations. We propose here a new method to compute a tight inner approximation of the set of reachable states of nonlinear dynamical systems on a bounded time
On static reachability analysis of IP networks
 In Proc. IEEE INFOCOM
, 2005
"... document without permission of its author may be prohibited by law. ..."
Abstract

Cited by 95 (14 self)
 Add to MetaCart
document without permission of its author may be prohibited by law.
Results 1  10
of
2,022