Conference Paper

Uppaal/DMC- Abstraction-Based Heuristics for Directed Model Checking.

DOI: 10.1007/978-3-540-71209-1_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

ABSTRACT UPPAAL/DMC is an extension of UPPAAL that provides generic heuris- tics for directed model checking. In this approach, the traversal of the state space is guided by a heuristic function which estimates the distance of a search state to the nearest error state. Our tool combines two recent approaches to design such estimation functions. Both are based on computing an abstraction of the system and using the error distance in this abstraction as the heuristic value. The abstrac- tions, and thus the heuristic functions, are generated fully automatically and do not need any additional user input. UPPAAL/DMC needs less time and memory to find shorter error paths than UPPAAL's standard search methods.

  • Source
  • Source
    [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 breadth-first 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 Subsumer-first 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 abstraction-based software verification. Our experimental evaluation of the heuristic in a predicate abstraction-based tool indicates its prac- tical applicability, as we observe significant efficiency improvement (me- dian of 40%) on difficult benchmarks from the transportation domain.
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A recent technique used in falsification methods for hybrid systems relies on distance-based 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 box-based distance measure between regions. We present an algorithm that, given two regions, efficiently computes the box-based distance between them. We have implemented the algorithm in SpaceEx and use it for guiding the region-based 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

Full-text (2 Sources)

Available from
May 16, 2014