Directed explicit model checking with HSF-SPIN

  • Authors:
  • Stefan Edelkamp;Alberto Lluch Lafuente;Stefan Leue

  • Affiliations:
  • Institut für Informatik, Albert-Ludwigs-Universität, Georges-Köhler-Allee D-79110 Freiburg;Institut für Informatik, Albert-Ludwigs-Universität, Georges-Köhler-Allee D-79110 Freiburg;Institut für Informatik, Albert-Ludwigs-Universität, Georges-Köhler-Allee D-79110 Freiburg

  • Venue:
  • SPIN '01 Proceedings of the 8th international SPIN workshop on Model checking of software
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present the explicit state model checker HSF-SPIN which is based on the model checker SPIN and its Promela modeling language. HSF-SPIN incorporates directed search algorithms for checking safety and a large class of LTL-specified liveness properties. We start off from the A* algorithm and define heuristics to accelerate the search into the direction of a specified failure situation. Next we propose an improved nested depth-first search algorithm that exploits the structure of Promela Never-Claims. As a result of both improvements, counterexamples will be shorter and the explored part of the state space will be smaller than with classical approaches, allowing to analyze larger state spaces. We evaluate the impact of the new heuristics and algorithms on a set of protocol models, some of which are real-world industrial protocols.