The Causal Graph Revisited for Directed Model Checking

  • Martin Wehrle
  • Malte Helmert
Conference paper

DOI: 10.1007/978-3-642-03237-0_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5673)
Cite this paper as:
Wehrle M., Helmert M. (2009) The Causal Graph Revisited for Directed Model Checking. In: Palsberg J., Su Z. (eds) Static Analysis. SAS 2009. Lecture Notes in Computer Science, vol 5673. Springer, Berlin, Heidelberg

Abstract

Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state space traversal is guided through a function that estimates the distance to nearest error states. States with lower estimates are preferably expanded during the search. Obviously, the challenge is to develop distance functions that are efficiently computable on the one hand and as informative as possible on the other hand. In this paper, we introduce the causal graph structure to the context of directed model checking. Based on causal graph analysis, we first adapt a distance estimation function from AI planning to directed model checking. Furthermore, we investigate an abstraction that is guaranteed to preserve error states. The experimental evaluation shows the practical potential of these techniques.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Martin Wehrle
    • 1
  • Malte Helmert
    • 1
  1. 1.University of FreiburgGermany

Personalised recommendations