Conference Paper
Uppaal/DMC AbstractionBased Heuristics for Directed Model Checking.
DOI: 10.1007/9783540712091_52 Conference: Tools and Algorithms for the Construction and Analysis of Systems, 13th International Conference, TACAS 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2007 Braga, Portugal, March 24  April 1, 2007, Proceedings
Source: DBLP

 [Show abstract] [Hide abstract]
ABSTRACT: State space exploration using symbolic techniques provides a basis for the verification of software systems. The exploration procedure has direct impact on the overall effectiveness of the verification efforts. For example, choosing the breadthfirst exploration strategy results in a verification tool that finds counterexamples quickly, but may sacri fice the efficiency of the reachability analysis. The existing exploration heuristics, such as Asearch or chaotic iteration, are geared towards op timizing only one objective, e.g., counterexample length or convergence of fixpoint computation, while neglecting various others that maybe of significant importance as well. In this paper, we present a new subsumer guided heuristic for symbolic state space exploration that supports both efficient counterexample discovery and quick convergence of the reacha bility computation. The Subsumerfirst heuristic leverages the results of partial fixpoint checks performed during the symbolic state space explo ration. We present an application of the heuristic for improving efficiency of abstractionbased software verification. Our experimental evaluation of the heuristic in a predicate abstractionbased tool indicates its prac tical applicability, as we observe significant efficiency improvement (me dian of 40%) on difficult benchmarks from the transportation domain. 
Conference Paper: A boxbased distance between regions for guiding the reachability analysis of spaceex
[Show abstract] [Hide abstract]
ABSTRACT: A recent technique used in falsification methods for hybrid systems relies on distancebased heuristics for guiding the search towards a goal state. The question is whether the technique can be carried over to reachability analyses that use regions as their basic data structure. In this paper, we introduce a boxbased distance measure between regions. We present an algorithm that, given two regions, efficiently computes the boxbased distance between them. We have implemented the algorithm in SpaceEx and use it for guiding the regionbased reachability analysis of SpaceEx. We illustrate the practical potential of our approach in a case study for the navigation benchmark.Proceedings of the 24th international conference on Computer Aided Verification; 07/2012
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.