Improving Non-Progress Cycle Checks

  • David Faragó
  • Peter H. Schmitt
Conference paper

DOI: 10.1007/978-3-642-02652-2_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5578)
Cite this paper as:
Faragó D., Schmitt P.H. (2009) Improving Non-Progress Cycle Checks. In: Păsăreanu C.S. (eds) Model Checking Software. SPIN 2009. Lecture Notes in Computer Science, vol 5578. Springer, Berlin, Heidelberg

Abstract

This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first search, i.e., it searches through the graph incrementally deeper. It simultaneously constructs the state space and searches for non-progress cycles. The algorithm is expected to be more efficient than the method the model checker SPIN currently uses, and finds shortest (w.r.t. progress) counterexamples. Its only downside is the need for a subsequent reachability depth-first search (which is not the bottleneck) for constructing a full counterexample. The new algorithm is better combinable with partial order reduction than SPIN’s method.

Keywords

Model Checking SPIN Non-progress cycles livelocks depth-first search partial order reduction 

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

  • David Faragó
    • 1
  • Peter H. Schmitt
    • 1
  1. 1.Institut für Theoretische Informatik Logik und Formale MethodenUniversität Karlsruhe (TH)Germany

Personalised recommendations