Transition-Based Directed Model Checking

  • Authors:
  • Martin Wehrle;Sebastian Kupferschmid;Andreas Podelski

  • Affiliations:
  • Department of Computer Science, University of Freiburg, Freiburg, Germany;Department of Computer Science, University of Freiburg, Freiburg, Germany;Department of Computer Science, University of Freiburg, Freiburg, Germany

  • Venue:
  • TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by influencing the order in which states are explored during the state space traversal. The order is typically determined by an abstract distance function that estimates a state's distance to a nearest error state. In this paper, we propose a general enhancement to directed model checking based on the evaluation of state transitions . We present a schema, parametrized by an abstract distance function, to evaluate transitions and propose a new method for the state space traversal. Our framework can be applied automatically to a wide range of abstract distance functions. The empirical evaluation impressively shows its practical potential. Apparently, the new method identifies a sweet spot in the trade-off between scalability (memory consumption) and short error traces.