Sciweavers

132 search results - page 3 / 27
» Ellipsoidal Techniques for Reachability Analysis
Sort
View
SLP
1997
89views more  SLP 1997»
13 years 6 months ago
Program Analysis via Graph Reachability
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are am...
Thomas W. Reps
DATE
1999
IEEE
73views Hardware» more  DATE 1999»
13 years 9 months ago
Channel-Based Behavioral Test Synthesis for Improved Module Reachability
We introduce a novel behavioral test synthesis methodology that attempts to increase module reachability, driven by powerful global design path analysis. Based on the notion of tr...
Yiorgos Makris, Alex Orailoglu
DATE
2003
IEEE
85views Hardware» more  DATE 2003»
13 years 10 months ago
Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...
Amit Goel, Randal E. Bryant
HYBRID
2007
Springer
13 years 11 months ago
Computational Approaches to Reachability Analysis of Stochastic Hybrid Systems
This work investigates some of the computational issues involved in the solution of probabilistic reachability problems for discretetime, controlled stochastic hybrid systems. It i...
Alessandro Abate, Saurabh Amin, Maria Prandini, Jo...
IJFCS
2008
81views more  IJFCS 2008»
13 years 5 months ago
Reachability Analysis in Verification via Supercompilation
Abstract. We present an approach to verification of parameterized systems, which is based on program transformation technique known as supercompilation. In this approach the statem...
Alexei Lisitsa, Andrei P. Nemytykh