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...
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...
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...
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...
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...